./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 73a9ab851ce1c73d80f83f7e6335d12ad87baacd38ef2209152d18ccc2128259
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-26 08:52:04,755 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-26 08:52:04,757 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-26 08:52:04,818 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-26 08:52:04,819 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-26 08:52:04,822 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-26 08:52:04,824 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-26 08:52:04,826 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-26 08:52:04,828 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-26 08:52:04,833 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-26 08:52:04,850 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-26 08:52:04,852 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-26 08:52:04,853 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-26 08:52:04,858 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-26 08:52:04,860 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-26 08:52:04,862 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-26 08:52:04,864 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-26 08:52:04,864 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-26 08:52:04,866 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-26 08:52:04,873 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-26 08:52:04,874 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-26 08:52:04,876 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-26 08:52:04,877 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-26 08:52:04,878 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-26 08:52:04,881 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-26 08:52:04,893 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-26 08:52:04,893 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-26 08:52:04,895 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-26 08:52:04,896 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-26 08:52:04,896 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-26 08:52:04,897 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-26 08:52:04,897 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-26 08:52:04,899 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-26 08:52:04,899 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-26 08:52:04,905 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-26 08:52:04,905 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-26 08:52:04,905 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-26 08:52:04,906 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-26 08:52:04,906 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-26 08:52:04,907 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-26 08:52:04,907 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-26 08:52:04,908 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-26 08:52:04,964 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-26 08:52:04,964 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-26 08:52:04,965 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-26 08:52:04,965 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-26 08:52:04,966 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-26 08:52:04,966 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-26 08:52:04,969 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-26 08:52:04,969 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-26 08:52:04,981 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-26 08:52:04,982 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-26 08:52:04,983 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-26 08:52:04,983 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-26 08:52:04,983 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-26 08:52:04,983 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-26 08:52:04,984 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-26 08:52:04,984 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-26 08:52:04,984 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-26 08:52:04,984 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-26 08:52:04,984 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-26 08:52:04,985 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-26 08:52:04,985 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-26 08:52:04,985 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-26 08:52:04,985 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-26 08:52:04,985 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-26 08:52:04,986 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-26 08:52:04,986 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-26 08:52:04,986 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-26 08:52:04,986 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-26 08:52:04,987 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-26 08:52:04,987 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-26 08:52:04,987 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-26 08:52:04,987 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-26 08:52:04,988 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-26 08:52:04,989 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-26 08:52:04,989 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-26 08:52:04,989 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-26 08:52:04,989 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-26 08:52:04,989 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 73a9ab851ce1c73d80f83f7e6335d12ad87baacd38ef2209152d18ccc2128259
[2023-10-26 08:52:05,414 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-26 08:52:05,441 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-26 08:52:05,444 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-26 08:52:05,450 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-26 08:52:05,451 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-26 08:52:05,452 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct.i
[2023-10-26 08:52:07,344 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-26 08:52:07,790 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-26 08:52:07,791 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct.i
[2023-10-26 08:52:07,814 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/5a9a2bd1f/22067eadfd7647c38c608fad36c6979f/FLAG754581413
[2023-10-26 08:52:07,838 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/5a9a2bd1f/22067eadfd7647c38c608fad36c6979f
[2023-10-26 08:52:07,842 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-26 08:52:07,843 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-26 08:52:07,844 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-26 08:52:07,845 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-26 08:52:07,852 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-26 08:52:07,852 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:52:07" (1/1) ...
[2023-10-26 08:52:07,854 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35856038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:07, skipping insertion in model container
[2023-10-26 08:52:07,869 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:52:07" (1/1) ...
[2023-10-26 08:52:07,880 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-26 08:52:07,950 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-26 08:52:08,186 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-26 08:52:08,513 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 08:52:08,522 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-26 08:52:08,540 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-26 08:52:08,631 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 08:52:08,710 INFO  L208         MainTranslator]: Completed translation
[2023-10-26 08:52:08,711 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:08 WrapperNode
[2023-10-26 08:52:08,711 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-26 08:52:08,712 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-26 08:52:08,712 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-26 08:52:08,712 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-26 08:52:08,733 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:08" (1/1) ...
[2023-10-26 08:52:08,759 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:08" (1/1) ...
[2023-10-26 08:52:08,817 INFO  L138                Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77
[2023-10-26 08:52:08,818 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-26 08:52:08,818 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-26 08:52:08,819 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-26 08:52:08,820 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-26 08:52:08,843 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:08" (1/1) ...
[2023-10-26 08:52:08,843 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:08" (1/1) ...
[2023-10-26 08:52:08,856 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:08" (1/1) ...
[2023-10-26 08:52:08,857 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:08" (1/1) ...
[2023-10-26 08:52:08,879 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:08" (1/1) ...
[2023-10-26 08:52:08,889 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:08" (1/1) ...
[2023-10-26 08:52:08,891 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:08" (1/1) ...
[2023-10-26 08:52:08,906 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:08" (1/1) ...
[2023-10-26 08:52:08,908 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-26 08:52:08,909 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-26 08:52:08,909 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-26 08:52:08,909 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-26 08:52:08,910 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:08" (1/1) ...
[2023-10-26 08:52:08,914 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-26 08:52:08,942 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:52:08,968 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-26 08:52:09,020 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-26 08:52:09,037 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-26 08:52:09,050 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-26 08:52:09,050 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-26 08:52:09,051 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-26 08:52:09,051 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-26 08:52:09,052 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-26 08:52:09,052 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-26 08:52:09,052 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-26 08:52:09,052 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-26 08:52:09,052 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-26 08:52:09,052 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-26 08:52:09,054 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-26 08:52:09,276 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-26 08:52:09,278 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-26 08:52:09,642 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-26 08:52:09,648 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-26 08:52:09,669 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-26 08:52:09,671 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:52:09 BoogieIcfgContainer
[2023-10-26 08:52:09,672 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-26 08:52:09,674 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-26 08:52:09,674 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-26 08:52:09,677 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-26 08:52:09,677 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:52:07" (1/3) ...
[2023-10-26 08:52:09,678 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364b9e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:52:09, skipping insertion in model container
[2023-10-26 08:52:09,678 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:08" (2/3) ...
[2023-10-26 08:52:09,679 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364b9e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:52:09, skipping insertion in model container
[2023-10-26 08:52:09,679 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:52:09" (3/3) ...
[2023-10-26 08:52:09,681 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct.i
[2023-10-26 08:52:09,687 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-26 08:52:09,715 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-26 08:52:09,715 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2023-10-26 08:52:09,715 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-26 08:52:09,844 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-26 08:52:09,892 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 214 flow
[2023-10-26 08:52:10,003 INFO  L130       PetriNetUnfolder]: 6/152 cut-off events.
[2023-10-26 08:52:10,003 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:52:10,023 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 158 conditions, 152 events. 6/152 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 287 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. 
[2023-10-26 08:52:10,023 INFO  L82        GeneralOperation]: Start removeDead. Operand has 102 places, 103 transitions, 214 flow
[2023-10-26 08:52:10,028 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 102 places, 103 transitions, 214 flow
[2023-10-26 08:52:10,031 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:52:10,059 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 103 transitions, 214 flow
[2023-10-26 08:52:10,071 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 103 transitions, 214 flow
[2023-10-26 08:52:10,072 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 214 flow
[2023-10-26 08:52:10,137 INFO  L130       PetriNetUnfolder]: 6/152 cut-off events.
[2023-10-26 08:52:10,137 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:52:10,138 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 158 conditions, 152 events. 6/152 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 287 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. 
[2023-10-26 08:52:10,140 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1792
[2023-10-26 08:52:12,547 INFO  L134        LiptonReduction]: Checked pairs total: 7802
[2023-10-26 08:52:12,547 INFO  L136        LiptonReduction]: Total number of compositions: 64
[2023-10-26 08:52:12,571 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:52:12,593 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@133b7c4e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:52:12,593 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2023-10-26 08:52:12,599 INFO  L130       PetriNetUnfolder]: 0/18 cut-off events.
[2023-10-26 08:52:12,600 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:52:12,600 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:12,601 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:52:12,602 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-26 08:52:12,606 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:12,607 INFO  L85        PathProgramCache]: Analyzing trace with hash -600513933, now seen corresponding path program 1 times
[2023-10-26 08:52:12,627 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:12,628 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134179397]
[2023-10-26 08:52:12,628 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:12,629 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:12,820 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:13,115 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:13,115 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:13,116 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134179397]
[2023-10-26 08:52:13,116 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134179397] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:52:13,116 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:52:13,117 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-26 08:52:13,118 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940822438]
[2023-10-26 08:52:13,118 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:52:13,124 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-26 08:52:13,137 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:13,168 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-26 08:52:13,169 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-26 08:52:13,262 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 167
[2023-10-26 08:52:13,265 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 102 flow. Second operand  has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:13,266 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:13,266 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 167
[2023-10-26 08:52:13,266 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:13,436 INFO  L130       PetriNetUnfolder]: 24/218 cut-off events.
[2023-10-26 08:52:13,436 INFO  L131       PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2023-10-26 08:52:13,438 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 301 conditions, 218 events. 24/218 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 907 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 227. Up to 63 conditions per place. 
[2023-10-26 08:52:13,440 INFO  L137   encePairwiseOnDemand]: 163/167 looper letters, 19 selfloop transitions, 3 changer transitions 2/56 dead transitions.
[2023-10-26 08:52:13,441 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 168 flow
[2023-10-26 08:52:13,442 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-26 08:52:13,444 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-26 08:52:13,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 393 transitions.
[2023-10-26 08:52:13,468 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5883233532934131
[2023-10-26 08:52:13,469 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 393 transitions.
[2023-10-26 08:52:13,469 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 393 transitions.
[2023-10-26 08:52:13,472 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:13,474 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 393 transitions.
[2023-10-26 08:52:13,487 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:13,497 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:13,497 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:13,499 INFO  L175             Difference]: Start difference. First operand has 49 places, 47 transitions, 102 flow. Second operand 4 states and 393 transitions.
[2023-10-26 08:52:13,500 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 168 flow
[2023-10-26 08:52:13,511 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 56 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:52:13,513 INFO  L231             Difference]: Finished difference. Result has 54 places, 48 transitions, 118 flow
[2023-10-26 08:52:13,514 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=54, PETRI_TRANSITIONS=48}
[2023-10-26 08:52:13,518 INFO  L288   CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places.
[2023-10-26 08:52:13,518 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 118 flow
[2023-10-26 08:52:13,518 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:13,518 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:13,519 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:52:13,519 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-26 08:52:13,519 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-26 08:52:13,534 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:13,535 INFO  L85        PathProgramCache]: Analyzing trace with hash -407873938, now seen corresponding path program 1 times
[2023-10-26 08:52:13,535 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:13,537 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948643890]
[2023-10-26 08:52:13,538 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:13,538 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:13,572 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:14,038 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:14,046 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:14,047 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948643890]
[2023-10-26 08:52:14,048 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948643890] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:52:14,048 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:52:14,052 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:52:14,052 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499679340]
[2023-10-26 08:52:14,052 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:52:14,053 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:52:14,053 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:14,054 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:52:14,055 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:52:14,296 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 73 out of 167
[2023-10-26 08:52:14,297 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 118 flow. Second operand  has 6 states, 6 states have (on average 74.33333333333333) internal successors, (446), 6 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:14,297 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:14,298 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 167
[2023-10-26 08:52:14,298 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:14,622 INFO  L130       PetriNetUnfolder]: 246/699 cut-off events.
[2023-10-26 08:52:14,622 INFO  L131       PetriNetUnfolder]: For 33/39 co-relation queries the response was YES.
[2023-10-26 08:52:14,624 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 699 events. 246/699 cut-off events. For 33/39 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3888 event pairs, 51 based on Foata normal form. 1/673 useless extension candidates. Maximal degree in co-relation 1254. Up to 348 conditions per place. 
[2023-10-26 08:52:14,635 INFO  L137   encePairwiseOnDemand]: 144/167 looper letters, 64 selfloop transitions, 29 changer transitions 1/104 dead transitions.
[2023-10-26 08:52:14,635 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 104 transitions, 428 flow
[2023-10-26 08:52:14,635 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:52:14,636 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:52:14,636 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 534 transitions.
[2023-10-26 08:52:14,648 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5329341317365269
[2023-10-26 08:52:14,648 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 534 transitions.
[2023-10-26 08:52:14,648 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 534 transitions.
[2023-10-26 08:52:14,649 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:14,649 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 534 transitions.
[2023-10-26 08:52:14,650 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:14,652 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:14,652 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:14,653 INFO  L175             Difference]: Start difference. First operand has 54 places, 48 transitions, 118 flow. Second operand 6 states and 534 transitions.
[2023-10-26 08:52:14,653 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 104 transitions, 428 flow
[2023-10-26 08:52:14,654 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 104 transitions, 425 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-26 08:52:14,655 INFO  L231             Difference]: Finished difference. Result has 63 places, 76 transitions, 330 flow
[2023-10-26 08:52:14,656 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=63, PETRI_TRANSITIONS=76}
[2023-10-26 08:52:14,656 INFO  L288   CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places.
[2023-10-26 08:52:14,656 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 76 transitions, 330 flow
[2023-10-26 08:52:14,657 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 74.33333333333333) internal successors, (446), 6 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:14,657 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:14,657 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:52:14,657 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-26 08:52:14,657 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-26 08:52:14,658 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:14,661 INFO  L85        PathProgramCache]: Analyzing trace with hash 525784661, now seen corresponding path program 1 times
[2023-10-26 08:52:14,661 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:14,662 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616279693]
[2023-10-26 08:52:14,662 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:14,662 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:14,705 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:15,214 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:15,215 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:15,216 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616279693]
[2023-10-26 08:52:15,216 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616279693] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:52:15,217 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:52:15,217 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:52:15,217 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288167972]
[2023-10-26 08:52:15,218 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:52:15,218 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:52:15,218 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:15,219 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:52:15,219 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:52:15,362 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 73 out of 167
[2023-10-26 08:52:15,362 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 76 transitions, 330 flow. Second operand  has 6 states, 6 states have (on average 75.33333333333333) internal successors, (452), 6 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:15,363 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:15,363 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 167
[2023-10-26 08:52:15,363 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:15,812 INFO  L130       PetriNetUnfolder]: 373/970 cut-off events.
[2023-10-26 08:52:15,812 INFO  L131       PetriNetUnfolder]: For 400/406 co-relation queries the response was YES.
[2023-10-26 08:52:15,815 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2641 conditions, 970 events. 373/970 cut-off events. For 400/406 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5726 event pairs, 93 based on Foata normal form. 0/912 useless extension candidates. Maximal degree in co-relation 2482. Up to 670 conditions per place. 
[2023-10-26 08:52:15,818 INFO  L137   encePairwiseOnDemand]: 145/167 looper letters, 83 selfloop transitions, 72 changer transitions 14/183 dead transitions.
[2023-10-26 08:52:15,827 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 183 transitions, 1068 flow
[2023-10-26 08:52:15,828 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:52:15,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:52:15,829 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 575 transitions.
[2023-10-26 08:52:15,830 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5738522954091816
[2023-10-26 08:52:15,830 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 575 transitions.
[2023-10-26 08:52:15,830 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 575 transitions.
[2023-10-26 08:52:15,830 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:15,831 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 575 transitions.
[2023-10-26 08:52:15,832 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:15,833 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:15,834 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:15,834 INFO  L175             Difference]: Start difference. First operand has 63 places, 76 transitions, 330 flow. Second operand 6 states and 575 transitions.
[2023-10-26 08:52:15,834 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 183 transitions, 1068 flow
[2023-10-26 08:52:15,856 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 183 transitions, 1052 flow, removed 5 selfloop flow, removed 2 redundant places.
[2023-10-26 08:52:15,859 INFO  L231             Difference]: Finished difference. Result has 69 places, 145 transitions, 864 flow
[2023-10-26 08:52:15,859 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=864, PETRI_PLACES=69, PETRI_TRANSITIONS=145}
[2023-10-26 08:52:15,860 INFO  L288   CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places.
[2023-10-26 08:52:15,860 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 145 transitions, 864 flow
[2023-10-26 08:52:15,861 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 75.33333333333333) internal successors, (452), 6 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:15,861 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:15,861 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-26 08:52:15,861 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-26 08:52:15,864 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-26 08:52:15,865 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:15,865 INFO  L85        PathProgramCache]: Analyzing trace with hash 1168448851, now seen corresponding path program 1 times
[2023-10-26 08:52:15,865 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:15,866 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61726349]
[2023-10-26 08:52:15,866 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:15,866 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:15,938 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:52:15,938 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-26 08:52:15,967 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:52:16,005 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-26 08:52:16,005 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-26 08:52:16,006 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2023-10-26 08:52:16,007 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2023-10-26 08:52:16,008 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2023-10-26 08:52:16,008 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2023-10-26 08:52:16,009 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2023-10-26 08:52:16,009 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2023-10-26 08:52:16,009 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2023-10-26 08:52:16,009 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-26 08:52:16,009 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2023-10-26 08:52:16,013 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-26 08:52:16,013 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-26 08:52:16,047 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-26 08:52:16,065 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 121 transitions, 260 flow
[2023-10-26 08:52:16,118 INFO  L130       PetriNetUnfolder]: 11/269 cut-off events.
[2023-10-26 08:52:16,119 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-26 08:52:16,122 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 283 conditions, 269 events. 11/269 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 603 event pairs, 0 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 154. Up to 8 conditions per place. 
[2023-10-26 08:52:16,122 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 121 transitions, 260 flow
[2023-10-26 08:52:16,123 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 121 transitions, 260 flow
[2023-10-26 08:52:16,124 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:52:16,124 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 121 transitions, 260 flow
[2023-10-26 08:52:16,124 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 121 transitions, 260 flow
[2023-10-26 08:52:16,124 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 121 transitions, 260 flow
[2023-10-26 08:52:16,159 INFO  L130       PetriNetUnfolder]: 11/269 cut-off events.
[2023-10-26 08:52:16,165 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-26 08:52:16,167 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 283 conditions, 269 events. 11/269 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 603 event pairs, 0 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 154. Up to 8 conditions per place. 
[2023-10-26 08:52:16,169 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4512
[2023-10-26 08:52:18,450 INFO  L134        LiptonReduction]: Checked pairs total: 20227
[2023-10-26 08:52:18,461 INFO  L136        LiptonReduction]: Total number of compositions: 72
[2023-10-26 08:52:18,463 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:52:18,466 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@133b7c4e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:52:18,468 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2023-10-26 08:52:18,473 INFO  L130       PetriNetUnfolder]: 0/18 cut-off events.
[2023-10-26 08:52:18,473 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:52:18,474 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:18,474 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:52:18,474 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:52:18,474 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:18,474 INFO  L85        PathProgramCache]: Analyzing trace with hash 320509981, now seen corresponding path program 1 times
[2023-10-26 08:52:18,475 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:18,475 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403345901]
[2023-10-26 08:52:18,484 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:18,485 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:18,496 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:18,542 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:18,557 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:18,557 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403345901]
[2023-10-26 08:52:18,558 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403345901] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:52:18,558 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:52:18,558 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-26 08:52:18,558 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309219190]
[2023-10-26 08:52:18,558 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:52:18,558 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-26 08:52:18,559 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:18,559 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-26 08:52:18,559 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-26 08:52:18,605 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 108 out of 193
[2023-10-26 08:52:18,621 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 136 flow. Second operand  has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:18,622 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:18,622 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 193
[2023-10-26 08:52:18,622 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:18,878 INFO  L130       PetriNetUnfolder]: 406/1207 cut-off events.
[2023-10-26 08:52:18,885 INFO  L131       PetriNetUnfolder]: For 80/120 co-relation queries the response was YES.
[2023-10-26 08:52:18,901 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1972 conditions, 1207 events. 406/1207 cut-off events. For 80/120 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7625 event pairs, 290 based on Foata normal form. 0/1076 useless extension candidates. Maximal degree in co-relation 650. Up to 713 conditions per place. 
[2023-10-26 08:52:18,906 INFO  L137   encePairwiseOnDemand]: 189/193 looper letters, 28 selfloop transitions, 3 changer transitions 2/70 dead transitions.
[2023-10-26 08:52:18,906 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 70 transitions, 224 flow
[2023-10-26 08:52:18,906 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-26 08:52:18,907 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-26 08:52:18,907 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions.
[2023-10-26 08:52:18,908 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6036269430051814
[2023-10-26 08:52:18,908 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 466 transitions.
[2023-10-26 08:52:18,908 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 466 transitions.
[2023-10-26 08:52:18,908 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:18,908 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 466 transitions.
[2023-10-26 08:52:18,914 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:18,916 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:18,917 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:18,917 INFO  L175             Difference]: Start difference. First operand has 62 places, 59 transitions, 136 flow. Second operand 4 states and 466 transitions.
[2023-10-26 08:52:18,917 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 70 transitions, 224 flow
[2023-10-26 08:52:18,918 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 70 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:52:18,919 INFO  L231             Difference]: Finished difference. Result has 67 places, 61 transitions, 156 flow
[2023-10-26 08:52:18,919 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=67, PETRI_TRANSITIONS=61}
[2023-10-26 08:52:18,920 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places.
[2023-10-26 08:52:18,920 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 156 flow
[2023-10-26 08:52:18,921 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:18,921 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:18,921 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:52:18,921 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-26 08:52:18,921 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:52:18,921 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:18,922 INFO  L85        PathProgramCache]: Analyzing trace with hash 684924882, now seen corresponding path program 1 times
[2023-10-26 08:52:18,922 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:18,922 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168338202]
[2023-10-26 08:52:18,922 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:18,922 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:18,942 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:19,176 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:19,176 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:19,176 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168338202]
[2023-10-26 08:52:19,177 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168338202] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:52:19,178 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:52:19,178 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:52:19,178 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743160272]
[2023-10-26 08:52:19,180 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:52:19,180 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:52:19,180 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:19,181 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:52:19,181 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:52:19,384 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 193
[2023-10-26 08:52:19,385 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 156 flow. Second operand  has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:19,385 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:19,385 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 193
[2023-10-26 08:52:19,385 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:21,290 INFO  L130       PetriNetUnfolder]: 5476/10051 cut-off events.
[2023-10-26 08:52:21,291 INFO  L131       PetriNetUnfolder]: For 425/445 co-relation queries the response was YES.
[2023-10-26 08:52:21,314 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19612 conditions, 10051 events. 5476/10051 cut-off events. For 425/445 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 70071 event pairs, 1407 based on Foata normal form. 2/9766 useless extension candidates. Maximal degree in co-relation 19515. Up to 6033 conditions per place. 
[2023-10-26 08:52:21,383 INFO  L137   encePairwiseOnDemand]: 166/193 looper letters, 92 selfloop transitions, 48 changer transitions 1/154 dead transitions.
[2023-10-26 08:52:21,395 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 154 transitions, 644 flow
[2023-10-26 08:52:21,396 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:52:21,396 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:52:21,397 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 651 transitions.
[2023-10-26 08:52:21,397 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5621761658031088
[2023-10-26 08:52:21,406 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 651 transitions.
[2023-10-26 08:52:21,406 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 651 transitions.
[2023-10-26 08:52:21,407 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:21,407 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 651 transitions.
[2023-10-26 08:52:21,408 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:21,410 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:21,411 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:21,411 INFO  L175             Difference]: Start difference. First operand has 67 places, 61 transitions, 156 flow. Second operand 6 states and 651 transitions.
[2023-10-26 08:52:21,412 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 154 transitions, 644 flow
[2023-10-26 08:52:21,414 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 154 transitions, 641 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-26 08:52:21,417 INFO  L231             Difference]: Finished difference. Result has 76 places, 108 transitions, 490 flow
[2023-10-26 08:52:21,417 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=76, PETRI_TRANSITIONS=108}
[2023-10-26 08:52:21,419 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 14 predicate places.
[2023-10-26 08:52:21,419 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 108 transitions, 490 flow
[2023-10-26 08:52:21,420 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:21,425 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:21,426 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:52:21,426 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-26 08:52:21,426 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:52:21,427 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:21,427 INFO  L85        PathProgramCache]: Analyzing trace with hash 853559299, now seen corresponding path program 1 times
[2023-10-26 08:52:21,427 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:21,427 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888309175]
[2023-10-26 08:52:21,427 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:21,428 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:21,458 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:21,782 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:21,782 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:21,782 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888309175]
[2023-10-26 08:52:21,782 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888309175] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:52:21,783 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:52:21,783 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:52:21,783 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315733394]
[2023-10-26 08:52:21,783 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:52:21,783 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:52:21,784 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:21,784 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:52:21,784 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:52:21,929 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 193
[2023-10-26 08:52:21,930 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 108 transitions, 490 flow. Second operand  has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:21,930 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:21,930 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 193
[2023-10-26 08:52:21,930 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:25,114 INFO  L130       PetriNetUnfolder]: 9320/16178 cut-off events.
[2023-10-26 08:52:25,114 INFO  L131       PetriNetUnfolder]: For 8208/8322 co-relation queries the response was YES.
[2023-10-26 08:52:25,185 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44381 conditions, 16178 events. 9320/16178 cut-off events. For 8208/8322 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 114584 event pairs, 2813 based on Foata normal form. 0/15540 useless extension candidates. Maximal degree in co-relation 26087. Up to 11753 conditions per place. 
[2023-10-26 08:52:25,301 INFO  L137   encePairwiseOnDemand]: 166/193 looper letters, 150 selfloop transitions, 142 changer transitions 0/309 dead transitions.
[2023-10-26 08:52:25,325 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 309 transitions, 1906 flow
[2023-10-26 08:52:25,326 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:52:25,326 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:52:25,327 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 697 transitions.
[2023-10-26 08:52:25,328 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6018998272884283
[2023-10-26 08:52:25,328 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 697 transitions.
[2023-10-26 08:52:25,328 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 697 transitions.
[2023-10-26 08:52:25,328 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:25,328 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 697 transitions.
[2023-10-26 08:52:25,329 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:25,331 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:25,331 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:25,331 INFO  L175             Difference]: Start difference. First operand has 76 places, 108 transitions, 490 flow. Second operand 6 states and 697 transitions.
[2023-10-26 08:52:25,331 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 309 transitions, 1906 flow
[2023-10-26 08:52:25,385 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 309 transitions, 1896 flow, removed 5 selfloop flow, removed 1 redundant places.
[2023-10-26 08:52:25,390 INFO  L231             Difference]: Finished difference. Result has 84 places, 245 transitions, 1786 flow
[2023-10-26 08:52:25,390 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1786, PETRI_PLACES=84, PETRI_TRANSITIONS=245}
[2023-10-26 08:52:25,391 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 22 predicate places.
[2023-10-26 08:52:25,392 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 245 transitions, 1786 flow
[2023-10-26 08:52:25,392 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:25,392 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:25,392 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:52:25,393 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-26 08:52:25,394 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:52:25,394 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:25,394 INFO  L85        PathProgramCache]: Analyzing trace with hash 2054895432, now seen corresponding path program 1 times
[2023-10-26 08:52:25,395 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:25,397 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062342375]
[2023-10-26 08:52:25,397 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:25,397 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:25,437 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:26,056 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:26,056 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:26,057 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062342375]
[2023-10-26 08:52:26,057 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062342375] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:52:26,057 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046073899]
[2023-10-26 08:52:26,057 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:26,057 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:52:26,057 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:52:26,066 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:52:26,089 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-10-26 08:52:26,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:26,223 INFO  L263         TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 23 conjunts are in the unsatisfiable core
[2023-10-26 08:52:26,227 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:52:26,461 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:52:26,516 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:52:26,563 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:52:26,564 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:52:26,624 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:52:26,624 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:52:26,708 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:26,710 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:52:26,738 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:26,738 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:52:26,901 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_246 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_246 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_246 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_246 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:52:27,052 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:27,052 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046073899] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:52:27,053 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:52:27,053 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22
[2023-10-26 08:52:27,053 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995335220]
[2023-10-26 08:52:27,053 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:52:27,053 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2023-10-26 08:52:27,053 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:27,054 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2023-10-26 08:52:27,054 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=412, Unknown=6, NotChecked=42, Total=552
[2023-10-26 08:52:27,267 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 193
[2023-10-26 08:52:27,268 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 245 transitions, 1786 flow. Second operand  has 24 states, 24 states have (on average 59.208333333333336) internal successors, (1421), 24 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:27,268 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:27,268 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 193
[2023-10-26 08:52:27,268 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:34,557 INFO  L130       PetriNetUnfolder]: 15201/25123 cut-off events.
[2023-10-26 08:52:34,558 INFO  L131       PetriNetUnfolder]: For 32286/32302 co-relation queries the response was YES.
[2023-10-26 08:52:34,643 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 91549 conditions, 25123 events. 15201/25123 cut-off events. For 32286/32302 co-relation queries the response was YES. Maximal size of possible extension queue 787. Compared 176049 event pairs, 2473 based on Foata normal form. 444/24147 useless extension candidates. Maximal degree in co-relation 76139. Up to 10732 conditions per place. 
[2023-10-26 08:52:34,845 INFO  L137   encePairwiseOnDemand]: 142/193 looper letters, 792 selfloop transitions, 383 changer transitions 21/1201 dead transitions.
[2023-10-26 08:52:34,861 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 1201 transitions, 9892 flow
[2023-10-26 08:52:34,862 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2023-10-26 08:52:34,862 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2023-10-26 08:52:34,866 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1626 transitions.
[2023-10-26 08:52:34,866 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4680483592400691
[2023-10-26 08:52:34,867 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1626 transitions.
[2023-10-26 08:52:34,867 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1626 transitions.
[2023-10-26 08:52:34,867 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:34,868 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1626 transitions.
[2023-10-26 08:52:34,870 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 90.33333333333333) internal successors, (1626), 18 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:34,875 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 193.0) internal successors, (3667), 19 states have internal predecessors, (3667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:34,876 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 193.0) internal successors, (3667), 19 states have internal predecessors, (3667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:34,877 INFO  L175             Difference]: Start difference. First operand has 84 places, 245 transitions, 1786 flow. Second operand 18 states and 1626 transitions.
[2023-10-26 08:52:34,877 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 1201 transitions, 9892 flow
[2023-10-26 08:52:35,654 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 1201 transitions, 9766 flow, removed 63 selfloop flow, removed 0 redundant places.
[2023-10-26 08:52:35,666 INFO  L231             Difference]: Finished difference. Result has 115 places, 617 transitions, 6070 flow
[2023-10-26 08:52:35,681 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=1732, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6070, PETRI_PLACES=115, PETRI_TRANSITIONS=617}
[2023-10-26 08:52:35,682 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 53 predicate places.
[2023-10-26 08:52:35,683 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 617 transitions, 6070 flow
[2023-10-26 08:52:35,683 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 59.208333333333336) internal successors, (1421), 24 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:35,683 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:35,684 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:52:35,690 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2023-10-26 08:52:35,888 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:52:35,888 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:52:35,888 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:35,888 INFO  L85        PathProgramCache]: Analyzing trace with hash -1888961290, now seen corresponding path program 1 times
[2023-10-26 08:52:35,889 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:35,889 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546551609]
[2023-10-26 08:52:35,889 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:35,890 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:35,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:36,386 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:36,386 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:36,387 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546551609]
[2023-10-26 08:52:36,387 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546551609] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:52:36,387 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731979699]
[2023-10-26 08:52:36,388 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:36,388 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:52:36,388 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:52:36,389 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:52:36,433 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-10-26 08:52:36,541 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:36,542 INFO  L263         TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 25 conjunts are in the unsatisfiable core
[2023-10-26 08:52:36,544 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:52:36,687 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:52:36,730 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:36,731 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:52:36,772 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:36,784 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:36,786 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:52:36,849 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:36,850 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:36,851 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:36,852 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:52:36,936 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:36,937 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:52:36,971 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:36,984 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:52:37,156 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))))) is different from false
[2023-10-26 08:52:37,181 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false
[2023-10-26 08:52:37,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-10-26 08:52:37,331 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [731979699] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:52:37,331 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:52:37,331 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24
[2023-10-26 08:52:37,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6450381]
[2023-10-26 08:52:37,331 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:52:37,332 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-26 08:52:37,332 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:37,332 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-26 08:52:37,332 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=445, Unknown=15, NotChecked=90, Total=650
[2023-10-26 08:52:37,548 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 193
[2023-10-26 08:52:37,550 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 617 transitions, 6070 flow. Second operand  has 26 states, 26 states have (on average 64.0) internal successors, (1664), 26 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:37,550 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:37,550 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 193
[2023-10-26 08:52:37,550 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:44,694 INFO  L130       PetriNetUnfolder]: 18975/31328 cut-off events.
[2023-10-26 08:52:44,701 INFO  L131       PetriNetUnfolder]: For 112088/112120 co-relation queries the response was YES.
[2023-10-26 08:52:44,873 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 158373 conditions, 31328 events. 18975/31328 cut-off events. For 112088/112120 co-relation queries the response was YES. Maximal size of possible extension queue 1027. Compared 226175 event pairs, 2318 based on Foata normal form. 488/29980 useless extension candidates. Maximal degree in co-relation 146765. Up to 12748 conditions per place. 
[2023-10-26 08:52:45,126 INFO  L137   encePairwiseOnDemand]: 166/193 looper letters, 836 selfloop transitions, 460 changer transitions 6/1307 dead transitions.
[2023-10-26 08:52:45,126 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 1307 transitions, 14709 flow
[2023-10-26 08:52:45,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2023-10-26 08:52:45,127 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2023-10-26 08:52:45,129 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 998 transitions.
[2023-10-26 08:52:45,130 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4309153713298791
[2023-10-26 08:52:45,130 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 998 transitions.
[2023-10-26 08:52:45,145 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 998 transitions.
[2023-10-26 08:52:45,146 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:45,146 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 998 transitions.
[2023-10-26 08:52:45,149 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 83.16666666666667) internal successors, (998), 12 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:45,152 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 193.0) internal successors, (2509), 13 states have internal predecessors, (2509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:45,153 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 193.0) internal successors, (2509), 13 states have internal predecessors, (2509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:45,153 INFO  L175             Difference]: Start difference. First operand has 115 places, 617 transitions, 6070 flow. Second operand 12 states and 998 transitions.
[2023-10-26 08:52:45,153 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 1307 transitions, 14709 flow
[2023-10-26 08:52:50,522 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 1307 transitions, 14552 flow, removed 77 selfloop flow, removed 1 redundant places.
[2023-10-26 08:52:50,540 INFO  L231             Difference]: Finished difference. Result has 132 places, 896 transitions, 10798 flow
[2023-10-26 08:52:50,541 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=6008, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10798, PETRI_PLACES=132, PETRI_TRANSITIONS=896}
[2023-10-26 08:52:50,542 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 70 predicate places.
[2023-10-26 08:52:50,542 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 896 transitions, 10798 flow
[2023-10-26 08:52:50,543 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 64.0) internal successors, (1664), 26 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:50,543 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:50,543 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:52:50,550 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-10-26 08:52:50,747 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:52:50,748 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:52:50,748 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:50,749 INFO  L85        PathProgramCache]: Analyzing trace with hash -1965125181, now seen corresponding path program 1 times
[2023-10-26 08:52:50,749 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:50,749 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128002034]
[2023-10-26 08:52:50,750 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:50,750 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:50,803 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:51,076 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:52:51,076 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:51,076 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128002034]
[2023-10-26 08:52:51,076 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128002034] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:52:51,076 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:52:51,077 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:52:51,077 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127337015]
[2023-10-26 08:52:51,077 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:52:51,077 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:52:51,077 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:51,078 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:52:51,078 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:52:51,410 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 193
[2023-10-26 08:52:51,410 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 896 transitions, 10798 flow. Second operand  has 6 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:51,410 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:51,410 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 193
[2023-10-26 08:52:51,411 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:57,451 INFO  L130       PetriNetUnfolder]: 16418/28625 cut-off events.
[2023-10-26 08:52:57,452 INFO  L131       PetriNetUnfolder]: For 155479/157778 co-relation queries the response was YES.
[2023-10-26 08:52:57,592 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 156092 conditions, 28625 events. 16418/28625 cut-off events. For 155479/157778 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 222329 event pairs, 2783 based on Foata normal form. 233/27907 useless extension candidates. Maximal degree in co-relation 148341. Up to 18865 conditions per place. 
[2023-10-26 08:52:57,772 INFO  L137   encePairwiseOnDemand]: 178/193 looper letters, 669 selfloop transitions, 214 changer transitions 14/1152 dead transitions.
[2023-10-26 08:52:57,772 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 1152 transitions, 15581 flow
[2023-10-26 08:52:57,772 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:52:57,773 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:52:57,777 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 669 transitions.
[2023-10-26 08:52:57,778 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5777202072538861
[2023-10-26 08:52:57,778 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 669 transitions.
[2023-10-26 08:52:57,778 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 669 transitions.
[2023-10-26 08:52:57,778 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:57,778 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 669 transitions.
[2023-10-26 08:52:57,780 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:57,795 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:57,795 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:57,795 INFO  L175             Difference]: Start difference. First operand has 132 places, 896 transitions, 10798 flow. Second operand 6 states and 669 transitions.
[2023-10-26 08:52:57,795 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 1152 transitions, 15581 flow
[2023-10-26 08:53:02,388 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 1152 transitions, 15559 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-10-26 08:53:02,403 INFO  L231             Difference]: Finished difference. Result has 139 places, 1087 transitions, 14274 flow
[2023-10-26 08:53:02,403 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=10776, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=896, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=14274, PETRI_PLACES=139, PETRI_TRANSITIONS=1087}
[2023-10-26 08:53:02,404 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 77 predicate places.
[2023-10-26 08:53:02,404 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 1087 transitions, 14274 flow
[2023-10-26 08:53:02,405 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:02,405 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:53:02,405 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:53:02,405 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-26 08:53:02,405 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:53:02,405 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:53:02,405 INFO  L85        PathProgramCache]: Analyzing trace with hash 1935419539, now seen corresponding path program 1 times
[2023-10-26 08:53:02,406 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:53:02,406 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838707832]
[2023-10-26 08:53:02,406 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:53:02,421 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:53:02,452 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:53:02,737 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2023-10-26 08:53:02,737 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:53:02,738 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838707832]
[2023-10-26 08:53:02,738 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838707832] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:53:02,738 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:53:02,738 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:53:02,738 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261430637]
[2023-10-26 08:53:02,738 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:53:02,738 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:53:02,739 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:53:02,739 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:53:02,739 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:53:02,894 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 193
[2023-10-26 08:53:02,895 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 1087 transitions, 14274 flow. Second operand  has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:02,895 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:53:02,895 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 193
[2023-10-26 08:53:02,895 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:53:12,166 INFO  L130       PetriNetUnfolder]: 21716/37020 cut-off events.
[2023-10-26 08:53:12,166 INFO  L131       PetriNetUnfolder]: For 214832/216490 co-relation queries the response was YES.
[2023-10-26 08:53:12,390 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 215547 conditions, 37020 events. 21716/37020 cut-off events. For 214832/216490 co-relation queries the response was YES. Maximal size of possible extension queue 1260. Compared 288881 event pairs, 2980 based on Foata normal form. 108/35388 useless extension candidates. Maximal degree in co-relation 205724. Up to 28521 conditions per place. 
[2023-10-26 08:53:12,548 INFO  L137   encePairwiseOnDemand]: 166/193 looper letters, 1054 selfloop transitions, 542 changer transitions 59/1699 dead transitions.
[2023-10-26 08:53:12,548 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 1699 transitions, 24290 flow
[2023-10-26 08:53:12,548 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:53:12,548 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:53:12,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 693 transitions.
[2023-10-26 08:53:12,551 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5984455958549223
[2023-10-26 08:53:12,551 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 693 transitions.
[2023-10-26 08:53:12,551 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 693 transitions.
[2023-10-26 08:53:12,552 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:53:12,552 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 693 transitions.
[2023-10-26 08:53:12,574 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:12,576 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:12,576 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:12,577 INFO  L175             Difference]: Start difference. First operand has 139 places, 1087 transitions, 14274 flow. Second operand 6 states and 693 transitions.
[2023-10-26 08:53:12,577 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 1699 transitions, 24290 flow
[2023-10-26 08:53:22,076 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 1699 transitions, 24074 flow, removed 108 selfloop flow, removed 0 redundant places.
[2023-10-26 08:53:22,114 INFO  L231             Difference]: Finished difference. Result has 149 places, 1540 transitions, 22206 flow
[2023-10-26 08:53:22,116 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=14166, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1087, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=698, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=22206, PETRI_PLACES=149, PETRI_TRANSITIONS=1540}
[2023-10-26 08:53:22,116 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 87 predicate places.
[2023-10-26 08:53:22,116 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 1540 transitions, 22206 flow
[2023-10-26 08:53:22,117 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:22,117 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:53:22,117 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:53:22,117 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-26 08:53:22,117 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:53:22,118 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:53:22,118 INFO  L85        PathProgramCache]: Analyzing trace with hash -1530475742, now seen corresponding path program 1 times
[2023-10-26 08:53:22,118 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:53:22,118 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495551330]
[2023-10-26 08:53:22,118 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:53:22,118 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:53:22,172 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:53:22,247 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:53:22,248 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:53:22,248 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495551330]
[2023-10-26 08:53:22,248 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495551330] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:53:22,248 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305373105]
[2023-10-26 08:53:22,248 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:53:22,248 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:53:22,249 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:53:22,262 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:53:22,301 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-10-26 08:53:22,410 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:53:22,411 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-26 08:53:22,413 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:53:22,456 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:53:22,457 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:53:22,498 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:53:22,498 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [305373105] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:53:22,498 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:53:22,498 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-10-26 08:53:22,499 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903106049]
[2023-10-26 08:53:22,499 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:53:22,500 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-26 08:53:22,500 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:53:22,500 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-26 08:53:22,501 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-10-26 08:53:22,609 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 193
[2023-10-26 08:53:22,610 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 1540 transitions, 22206 flow. Second operand  has 9 states, 9 states have (on average 106.22222222222223) internal successors, (956), 9 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:22,610 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:53:22,610 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 193
[2023-10-26 08:53:22,610 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:53:28,789 INFO  L130       PetriNetUnfolder]: 14368/25966 cut-off events.
[2023-10-26 08:53:28,789 INFO  L131       PetriNetUnfolder]: For 188753/190826 co-relation queries the response was YES.
[2023-10-26 08:53:28,961 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 156699 conditions, 25966 events. 14368/25966 cut-off events. For 188753/190826 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 206381 event pairs, 1525 based on Foata normal form. 242/25853 useless extension candidates. Maximal degree in co-relation 151433. Up to 9439 conditions per place. 
[2023-10-26 08:53:29,065 INFO  L137   encePairwiseOnDemand]: 186/193 looper letters, 295 selfloop transitions, 8 changer transitions 39/1452 dead transitions.
[2023-10-26 08:53:29,065 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 1452 transitions, 21652 flow
[2023-10-26 08:53:29,066 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-26 08:53:29,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-26 08:53:29,067 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 778 transitions.
[2023-10-26 08:53:29,068 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5758697261287935
[2023-10-26 08:53:29,068 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 778 transitions.
[2023-10-26 08:53:29,068 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 778 transitions.
[2023-10-26 08:53:29,068 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:53:29,068 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 778 transitions.
[2023-10-26 08:53:29,087 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:29,089 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:29,089 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:29,089 INFO  L175             Difference]: Start difference. First operand has 149 places, 1540 transitions, 22206 flow. Second operand 7 states and 778 transitions.
[2023-10-26 08:53:29,090 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 1452 transitions, 21652 flow
[2023-10-26 08:53:35,045 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 1452 transitions, 21220 flow, removed 210 selfloop flow, removed 1 redundant places.
[2023-10-26 08:53:35,071 INFO  L231             Difference]: Finished difference. Result has 156 places, 1286 transitions, 18278 flow
[2023-10-26 08:53:35,072 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=18679, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=18278, PETRI_PLACES=156, PETRI_TRANSITIONS=1286}
[2023-10-26 08:53:35,073 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 94 predicate places.
[2023-10-26 08:53:35,074 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 1286 transitions, 18278 flow
[2023-10-26 08:53:35,074 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 106.22222222222223) internal successors, (956), 9 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:35,074 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:53:35,074 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:53:35,081 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-10-26 08:53:35,280 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2023-10-26 08:53:35,280 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:53:35,281 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:53:35,281 INFO  L85        PathProgramCache]: Analyzing trace with hash 860108621, now seen corresponding path program 1 times
[2023-10-26 08:53:35,282 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:53:35,282 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948993806]
[2023-10-26 08:53:35,282 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:53:35,282 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:53:35,339 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:53:36,182 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:53:36,183 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:53:36,183 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948993806]
[2023-10-26 08:53:36,183 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948993806] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:53:36,183 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947001632]
[2023-10-26 08:53:36,183 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:53:36,183 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:53:36,183 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:53:36,184 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:53:36,220 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-10-26 08:53:36,347 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:53:36,350 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 45 conjunts are in the unsatisfiable core
[2023-10-26 08:53:36,353 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:53:36,366 INFO  L321             Elim1Store]: treesize reduction 23, result has 17.9 percent of original size
[2023-10-26 08:53:36,366 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26
[2023-10-26 08:53:36,414 INFO  L321             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2023-10-26 08:53:36,414 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2023-10-26 08:53:36,514 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 08:53:36,521 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2023-10-26 08:53:36,573 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2023-10-26 08:53:36,622 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:53:36,678 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:53:36,740 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:53:36,741 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:53:36,836 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:53:36,837 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:53:36,992 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-10-26 08:53:37,050 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:53:37,079 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:53:37,119 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:53:37,148 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:53:37,202 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:53:37,211 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:53:37,211 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:53:37,239 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_619 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_619 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-10-26 08:53:37,539 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse0 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse0 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse0 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse0 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2023-10-26 08:53:37,605 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:53:37,637 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2023-10-26 08:53:37,904 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-26 08:53:37,904 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [947001632] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:53:37,904 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:53:37,904 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30
[2023-10-26 08:53:37,905 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385887786]
[2023-10-26 08:53:37,905 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:53:37,905 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2023-10-26 08:53:37,905 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:53:37,905 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2023-10-26 08:53:37,906 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=625, Unknown=28, NotChecked=220, Total=992
[2023-10-26 08:53:37,923 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 193
[2023-10-26 08:53:37,924 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 1286 transitions, 18278 flow. Second operand  has 32 states, 32 states have (on average 54.21875) internal successors, (1735), 32 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:37,924 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:53:37,924 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 193
[2023-10-26 08:53:37,924 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:53:52,518 INFO  L130       PetriNetUnfolder]: 20754/34185 cut-off events.
[2023-10-26 08:53:52,518 INFO  L131       PetriNetUnfolder]: For 249847/249847 co-relation queries the response was YES.
[2023-10-26 08:53:52,677 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 222240 conditions, 34185 events. 20754/34185 cut-off events. For 249847/249847 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 246789 event pairs, 2245 based on Foata normal form. 10/34195 useless extension candidates. Maximal degree in co-relation 210820. Up to 29454 conditions per place. 
[2023-10-26 08:53:52,807 INFO  L137   encePairwiseOnDemand]: 146/193 looper letters, 1498 selfloop transitions, 379 changer transitions 37/1916 dead transitions.
[2023-10-26 08:53:52,808 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 1916 transitions, 29258 flow
[2023-10-26 08:53:52,808 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2023-10-26 08:53:52,808 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2023-10-26 08:53:52,818 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1484 transitions.
[2023-10-26 08:53:52,819 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3495054168629298
[2023-10-26 08:53:52,819 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1484 transitions.
[2023-10-26 08:53:52,819 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1484 transitions.
[2023-10-26 08:53:52,820 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:53:52,820 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1484 transitions.
[2023-10-26 08:53:52,822 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 67.45454545454545) internal successors, (1484), 22 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:52,841 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 193.0) internal successors, (4439), 23 states have internal predecessors, (4439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:52,853 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 193.0) internal successors, (4439), 23 states have internal predecessors, (4439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:52,853 INFO  L175             Difference]: Start difference. First operand has 156 places, 1286 transitions, 18278 flow. Second operand 22 states and 1484 transitions.
[2023-10-26 08:53:52,853 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 1916 transitions, 29258 flow
[2023-10-26 08:54:00,776 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 1916 transitions, 29237 flow, removed 5 selfloop flow, removed 4 redundant places.
[2023-10-26 08:54:00,801 INFO  L231             Difference]: Finished difference. Result has 184 places, 1574 transitions, 23573 flow
[2023-10-26 08:54:00,802 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=18268, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1014, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=23573, PETRI_PLACES=184, PETRI_TRANSITIONS=1574}
[2023-10-26 08:54:00,802 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 122 predicate places.
[2023-10-26 08:54:00,803 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 1574 transitions, 23573 flow
[2023-10-26 08:54:00,803 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 54.21875) internal successors, (1735), 32 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:54:00,803 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:54:00,803 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:54:00,810 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2023-10-26 08:54:01,008 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:54:01,008 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:54:01,011 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:54:01,011 INFO  L85        PathProgramCache]: Analyzing trace with hash 103820759, now seen corresponding path program 2 times
[2023-10-26 08:54:01,011 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:54:01,011 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609085401]
[2023-10-26 08:54:01,012 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:54:01,012 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:54:01,065 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:54:02,015 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:54:02,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:54:02,016 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609085401]
[2023-10-26 08:54:02,016 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609085401] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:54:02,016 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293749343]
[2023-10-26 08:54:02,016 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-26 08:54:02,016 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:54:02,016 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:54:02,029 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:54:02,077 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-10-26 08:54:02,190 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-26 08:54:02,191 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:54:02,192 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 42 conjunts are in the unsatisfiable core
[2023-10-26 08:54:02,196 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:54:02,200 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:54:02,201 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15
[2023-10-26 08:54:02,259 INFO  L321             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2023-10-26 08:54:02,260 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2023-10-26 08:54:02,412 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 08:54:02,412 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-10-26 08:54:02,475 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:54:02,475 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-10-26 08:54:02,540 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:54:02,607 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:54:02,694 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:54:02,694 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:54:02,863 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-26 08:54:02,943 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:54:02,943 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:54:03,040 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:54:03,041 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:54:03,076 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:54:03,077 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:54:03,131 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:54:03,132 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:54:03,181 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:54:03,182 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:54:03,270 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:54:03,281 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:54:03,281 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:54:03,512 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2023-10-26 08:54:03,590 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2023-10-26 08:54:03,627 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:54:03,724 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:54:04,074 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-26 08:54:04,074 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293749343] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:54:04,074 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:54:04,074 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 31
[2023-10-26 08:54:04,075 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038743062]
[2023-10-26 08:54:04,075 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:54:04,075 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2023-10-26 08:54:04,075 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:54:04,075 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2023-10-26 08:54:04,076 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=692, Unknown=20, NotChecked=228, Total=1056
[2023-10-26 08:54:04,462 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 193
[2023-10-26 08:54:04,464 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 1574 transitions, 23573 flow. Second operand  has 33 states, 33 states have (on average 54.15151515151515) internal successors, (1787), 33 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:54:04,464 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:54:04,464 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 193
[2023-10-26 08:54:04,464 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:54:21,087 INFO  L130       PetriNetUnfolder]: 22025/36230 cut-off events.
[2023-10-26 08:54:21,098 INFO  L131       PetriNetUnfolder]: For 318170/318170 co-relation queries the response was YES.
[2023-10-26 08:54:21,317 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 255690 conditions, 36230 events. 22025/36230 cut-off events. For 318170/318170 co-relation queries the response was YES. Maximal size of possible extension queue 1005. Compared 262686 event pairs, 2277 based on Foata normal form. 48/36278 useless extension candidates. Maximal degree in co-relation 255398. Up to 29436 conditions per place. 
[2023-10-26 08:54:21,458 INFO  L137   encePairwiseOnDemand]: 152/193 looper letters, 1654 selfloop transitions, 654 changer transitions 10/2320 dead transitions.
[2023-10-26 08:54:21,458 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 2320 transitions, 38009 flow
[2023-10-26 08:54:21,459 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2023-10-26 08:54:21,459 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2023-10-26 08:54:21,475 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1745 transitions.
[2023-10-26 08:54:21,477 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3477481068154643
[2023-10-26 08:54:21,477 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1745 transitions.
[2023-10-26 08:54:21,477 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1745 transitions.
[2023-10-26 08:54:21,478 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:54:21,478 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1745 transitions.
[2023-10-26 08:54:21,482 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 67.11538461538461) internal successors, (1745), 26 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:54:21,502 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 193.0) internal successors, (5211), 27 states have internal predecessors, (5211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:54:21,503 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 193.0) internal successors, (5211), 27 states have internal predecessors, (5211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:54:21,503 INFO  L175             Difference]: Start difference. First operand has 184 places, 1574 transitions, 23573 flow. Second operand 26 states and 1745 transitions.
[2023-10-26 08:54:21,503 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 2320 transitions, 38009 flow
[2023-10-26 08:54:32,073 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 2320 transitions, 37529 flow, removed 238 selfloop flow, removed 3 redundant places.
[2023-10-26 08:54:32,128 INFO  L231             Difference]: Finished difference. Result has 219 places, 1900 transitions, 31113 flow
[2023-10-26 08:54:32,129 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=23363, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=356, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1063, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=31113, PETRI_PLACES=219, PETRI_TRANSITIONS=1900}
[2023-10-26 08:54:32,131 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 157 predicate places.
[2023-10-26 08:54:32,131 INFO  L495      AbstractCegarLoop]: Abstraction has has 219 places, 1900 transitions, 31113 flow
[2023-10-26 08:54:32,131 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 33 states, 33 states have (on average 54.15151515151515) internal successors, (1787), 33 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:54:32,131 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:54:32,132 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:54:32,145 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2023-10-26 08:54:32,336 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2023-10-26 08:54:32,336 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:54:32,337 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:54:32,337 INFO  L85        PathProgramCache]: Analyzing trace with hash 696920881, now seen corresponding path program 3 times
[2023-10-26 08:54:32,337 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:54:32,337 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343531410]
[2023-10-26 08:54:32,337 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:54:32,337 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:54:32,357 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:54:33,025 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:54:33,026 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:54:33,026 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343531410]
[2023-10-26 08:54:33,026 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343531410] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:54:33,026 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529230689]
[2023-10-26 08:54:33,026 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-26 08:54:33,026 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:54:33,026 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:54:33,027 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:54:33,073 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2023-10-26 08:54:33,250 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-26 08:54:33,250 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:54:33,252 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 48 conjunts are in the unsatisfiable core
[2023-10-26 08:54:33,255 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:54:33,266 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:54:33,267 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15
[2023-10-26 08:54:33,305 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:54:33,330 INFO  L321             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2023-10-26 08:54:33,332 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2023-10-26 08:54:33,501 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 08:54:33,501 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-10-26 08:54:33,585 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-10-26 08:54:33,698 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-26 08:54:33,729 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:54:33,735 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:54:33,747 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:54:33,747 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:54:33,760 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:54:33,761 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:54:33,788 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:54:33,796 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:54:33,797 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:54:33,828 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false
[2023-10-26 08:54:34,035 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2023-10-26 08:54:34,544 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:54:34,544 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [529230689] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:54:34,544 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:54:34,544 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 29
[2023-10-26 08:54:34,544 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083848586]
[2023-10-26 08:54:34,544 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:54:34,544 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 31 states
[2023-10-26 08:54:34,544 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:54:34,545 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2023-10-26 08:54:34,545 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=702, Unknown=13, NotChecked=110, Total=930
[2023-10-26 08:54:34,713 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 43 out of 193
[2023-10-26 08:54:34,714 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 1900 transitions, 31113 flow. Second operand  has 31 states, 31 states have (on average 45.03225806451613) internal successors, (1396), 31 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:54:34,714 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:54:34,714 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 193
[2023-10-26 08:54:34,714 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:55:04,584 INFO  L130       PetriNetUnfolder]: 37574/61733 cut-off events.
[2023-10-26 08:55:04,585 INFO  L131       PetriNetUnfolder]: For 671407/671407 co-relation queries the response was YES.
[2023-10-26 08:55:05,161 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 470098 conditions, 61733 events. 37574/61733 cut-off events. For 671407/671407 co-relation queries the response was YES. Maximal size of possible extension queue 1665. Compared 484169 event pairs, 3577 based on Foata normal form. 317/62050 useless extension candidates. Maximal degree in co-relation 452430. Up to 28953 conditions per place. 
[2023-10-26 08:55:05,546 INFO  L137   encePairwiseOnDemand]: 150/193 looper letters, 3096 selfloop transitions, 1683 changer transitions 40/4821 dead transitions.
[2023-10-26 08:55:05,546 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 4821 transitions, 85383 flow
[2023-10-26 08:55:05,546 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 
[2023-10-26 08:55:05,546 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 35 states.
[2023-10-26 08:55:05,561 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2108 transitions.
[2023-10-26 08:55:05,562 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3120651369356033
[2023-10-26 08:55:05,562 INFO  L72            ComplementDD]: Start complementDD. Operand 35 states and 2108 transitions.
[2023-10-26 08:55:05,562 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 35 states and 2108 transitions.
[2023-10-26 08:55:05,562 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:55:05,562 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2108 transitions.
[2023-10-26 08:55:05,583 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 36 states, 35 states have (on average 60.22857142857143) internal successors, (2108), 35 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:05,588 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 36 states, 36 states have (on average 193.0) internal successors, (6948), 36 states have internal predecessors, (6948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:05,589 INFO  L81            ComplementDD]: Finished complementDD. Result  has 36 states, 36 states have (on average 193.0) internal successors, (6948), 36 states have internal predecessors, (6948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:05,589 INFO  L175             Difference]: Start difference. First operand has 219 places, 1900 transitions, 31113 flow. Second operand 35 states and 2108 transitions.
[2023-10-26 08:55:05,589 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 4821 transitions, 85383 flow
[2023-10-26 08:55:41,062 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 4821 transitions, 84968 flow, removed 148 selfloop flow, removed 8 redundant places.
[2023-10-26 08:55:41,116 INFO  L231             Difference]: Finished difference. Result has 270 places, 3290 transitions, 62487 flow
[2023-10-26 08:55:41,117 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=30854, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1900, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=452, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=827, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=62487, PETRI_PLACES=270, PETRI_TRANSITIONS=3290}
[2023-10-26 08:55:41,119 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 208 predicate places.
[2023-10-26 08:55:41,119 INFO  L495      AbstractCegarLoop]: Abstraction has has 270 places, 3290 transitions, 62487 flow
[2023-10-26 08:55:41,119 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 31 states, 31 states have (on average 45.03225806451613) internal successors, (1396), 31 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:41,120 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:55:41,120 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:55:41,126 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2023-10-26 08:55:41,324 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2023-10-26 08:55:41,325 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:55:41,341 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:55:41,341 INFO  L85        PathProgramCache]: Analyzing trace with hash 396680715, now seen corresponding path program 4 times
[2023-10-26 08:55:41,342 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:55:41,342 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314534122]
[2023-10-26 08:55:41,342 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:55:41,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:55:41,366 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:55:42,286 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:55:42,287 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:55:42,287 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314534122]
[2023-10-26 08:55:42,287 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314534122] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:55:42,287 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622118070]
[2023-10-26 08:55:42,287 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-10-26 08:55:42,287 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:55:42,287 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:55:42,288 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:55:42,325 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2023-10-26 08:55:42,644 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-10-26 08:55:42,644 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:55:42,652 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 53 conjunts are in the unsatisfiable core
[2023-10-26 08:55:42,655 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:55:42,661 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:42,662 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15
[2023-10-26 08:55:42,714 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:42,727 INFO  L321             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2023-10-26 08:55:42,727 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2023-10-26 08:55:42,950 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 08:55:42,951 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-10-26 08:55:43,031 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-10-26 08:55:43,127 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:55:43,215 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:43,215 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:55:43,349 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-26 08:55:43,416 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:43,417 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:43,418 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:55:43,493 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:43,495 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:43,496 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:43,497 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:55:43,609 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:55:43,634 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:55:43,661 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:55:43,692 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:55:43,807 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:55:43,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:55:43,864 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:55:44,101 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2023-10-26 08:55:44,164 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2023-10-26 08:55:44,189 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:55:44,220 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) .cse1 v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) .cse1 v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) .cse1 v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936) .cse1 v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:55:44,594 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-26 08:55:44,595 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [622118070] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:55:44,595 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:55:44,595 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 33
[2023-10-26 08:55:44,595 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310977236]
[2023-10-26 08:55:44,595 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:55:44,596 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2023-10-26 08:55:44,596 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:55:44,596 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2023-10-26 08:55:44,596 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=802, Unknown=22, NotChecked=244, Total=1190
[2023-10-26 08:55:44,740 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 193
[2023-10-26 08:55:44,741 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 3290 transitions, 62487 flow. Second operand  has 35 states, 35 states have (on average 54.08571428571429) internal successors, (1893), 35 states have internal predecessors, (1893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:44,742 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:55:44,742 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 193
[2023-10-26 08:55:44,742 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:56:28,030 INFO  L130       PetriNetUnfolder]: 38774/63721 cut-off events.
[2023-10-26 08:56:28,031 INFO  L131       PetriNetUnfolder]: For 1153759/1153759 co-relation queries the response was YES.
[2023-10-26 08:56:28,811 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 567792 conditions, 63721 events. 38774/63721 cut-off events. For 1153759/1153759 co-relation queries the response was YES. Maximal size of possible extension queue 1725. Compared 501786 event pairs, 4188 based on Foata normal form. 80/63801 useless extension candidates. Maximal degree in co-relation 555835. Up to 49262 conditions per place. 
[2023-10-26 08:56:29,121 INFO  L137   encePairwiseOnDemand]: 156/193 looper letters, 2780 selfloop transitions, 1316 changer transitions 9/4107 dead transitions.
[2023-10-26 08:56:29,121 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 4107 transitions, 85468 flow
[2023-10-26 08:56:29,122 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. 
[2023-10-26 08:56:29,122 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 27 states.
[2023-10-26 08:56:29,124 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1806 transitions.
[2023-10-26 08:56:29,124 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3465745538284398
[2023-10-26 08:56:29,125 INFO  L72            ComplementDD]: Start complementDD. Operand 27 states and 1806 transitions.
[2023-10-26 08:56:29,125 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 27 states and 1806 transitions.
[2023-10-26 08:56:29,125 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:56:29,126 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 1806 transitions.
[2023-10-26 08:56:29,127 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 28 states, 27 states have (on average 66.88888888888889) internal successors, (1806), 27 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:56:29,144 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 28 states, 28 states have (on average 193.0) internal successors, (5404), 28 states have internal predecessors, (5404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:56:29,149 INFO  L81            ComplementDD]: Finished complementDD. Result  has 28 states, 28 states have (on average 193.0) internal successors, (5404), 28 states have internal predecessors, (5404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:56:29,149 INFO  L175             Difference]: Start difference. First operand has 270 places, 3290 transitions, 62487 flow. Second operand 27 states and 1806 transitions.
[2023-10-26 08:56:29,150 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 4107 transitions, 85468 flow
[2023-10-26 08:57:36,160 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 4107 transitions, 84789 flow, removed 331 selfloop flow, removed 5 redundant places.
[2023-10-26 08:57:36,219 INFO  L231             Difference]: Finished difference. Result has 306 places, 3645 transitions, 75225 flow
[2023-10-26 08:57:36,222 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=61862, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1002, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=75225, PETRI_PLACES=306, PETRI_TRANSITIONS=3645}
[2023-10-26 08:57:36,239 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 244 predicate places.
[2023-10-26 08:57:36,240 INFO  L495      AbstractCegarLoop]: Abstraction has has 306 places, 3645 transitions, 75225 flow
[2023-10-26 08:57:36,241 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 54.08571428571429) internal successors, (1893), 35 states have internal predecessors, (1893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:36,241 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:57:36,241 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:57:36,249 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2023-10-26 08:57:36,445 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2023-10-26 08:57:36,446 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:57:36,446 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:57:36,446 INFO  L85        PathProgramCache]: Analyzing trace with hash 776633815, now seen corresponding path program 5 times
[2023-10-26 08:57:36,446 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:57:36,447 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791422923]
[2023-10-26 08:57:36,447 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:57:36,447 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:57:36,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:57:37,383 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:57:37,383 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:57:37,383 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791422923]
[2023-10-26 08:57:37,383 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791422923] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:57:37,383 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447482470]
[2023-10-26 08:57:37,384 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-10-26 08:57:37,384 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:57:37,384 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:57:37,395 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:57:37,431 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2023-10-26 08:57:37,574 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-26 08:57:37,574 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:57:37,575 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 47 conjunts are in the unsatisfiable core
[2023-10-26 08:57:37,581 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:57:37,596 INFO  L321             Elim1Store]: treesize reduction 23, result has 17.9 percent of original size
[2023-10-26 08:57:37,596 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26
[2023-10-26 08:57:37,645 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:57:37,651 INFO  L321             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2023-10-26 08:57:37,652 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18
[2023-10-26 08:57:37,792 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 08:57:37,792 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2023-10-26 08:57:37,856 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:57:37,857 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2023-10-26 08:57:37,928 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:57:37,978 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-10-26 08:57:38,031 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:57:38,102 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:57:38,102 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:57:38,179 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:57:38,179 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:57:38,264 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:57:38,265 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:57:38,296 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:57:38,297 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:57:38,310 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:57:38,311 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:57:38,350 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:57:38,351 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:57:38,399 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:57:38,407 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:57:38,407 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:57:38,436 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1045 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1045 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1045 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1045 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2023-10-26 08:57:38,490 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2023-10-26 08:57:38,843 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2023-10-26 08:57:39,098 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:57:39,099 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447482470] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:57:39,099 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:57:39,099 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30
[2023-10-26 08:57:39,099 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533142167]
[2023-10-26 08:57:39,099 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:57:39,099 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2023-10-26 08:57:39,099 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:57:39,099 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2023-10-26 08:57:39,100 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=685, Unknown=24, NotChecked=168, Total=992
[2023-10-26 08:57:39,273 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 193
[2023-10-26 08:57:39,274 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 3645 transitions, 75225 flow. Second operand  has 32 states, 32 states have (on average 54.125) internal successors, (1732), 32 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:39,274 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:57:39,274 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 193
[2023-10-26 08:57:39,274 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:58:26,470 INFO  L130       PetriNetUnfolder]: 39195/64409 cut-off events.
[2023-10-26 08:58:26,470 INFO  L131       PetriNetUnfolder]: For 1367162/1367164 co-relation queries the response was YES.
[2023-10-26 08:58:27,374 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 605122 conditions, 64409 events. 39195/64409 cut-off events. For 1367162/1367164 co-relation queries the response was YES. Maximal size of possible extension queue 1762. Compared 507820 event pairs, 4178 based on Foata normal form. 98/64507 useless extension candidates. Maximal degree in co-relation 593094. Up to 48933 conditions per place. 
[2023-10-26 08:58:27,681 INFO  L137   encePairwiseOnDemand]: 155/193 looper letters, 2957 selfloop transitions, 1481 changer transitions 9/4449 dead transitions.
[2023-10-26 08:58:27,681 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 4449 transitions, 99440 flow
[2023-10-26 08:58:27,681 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2023-10-26 08:58:27,681 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2023-10-26 08:58:27,684 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1638 transitions.
[2023-10-26 08:58:27,684 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3536269430051813
[2023-10-26 08:58:27,685 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 1638 transitions.
[2023-10-26 08:58:27,685 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 1638 transitions.
[2023-10-26 08:58:27,686 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:58:27,686 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1638 transitions.
[2023-10-26 08:58:27,687 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 68.25) internal successors, (1638), 24 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:27,690 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 193.0) internal successors, (4825), 25 states have internal predecessors, (4825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:27,691 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 193.0) internal successors, (4825), 25 states have internal predecessors, (4825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:27,691 INFO  L175             Difference]: Start difference. First operand has 306 places, 3645 transitions, 75225 flow. Second operand 24 states and 1638 transitions.
[2023-10-26 08:58:27,691 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 4449 transitions, 99440 flow
[2023-10-26 08:59:49,557 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 4449 transitions, 98416 flow, removed 406 selfloop flow, removed 11 redundant places.
[2023-10-26 08:59:49,640 INFO  L231             Difference]: Finished difference. Result has 332 places, 3977 transitions, 88467 flow
[2023-10-26 08:59:49,655 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=74278, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=88467, PETRI_PLACES=332, PETRI_TRANSITIONS=3977}
[2023-10-26 08:59:49,657 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 270 predicate places.
[2023-10-26 08:59:49,657 INFO  L495      AbstractCegarLoop]: Abstraction has has 332 places, 3977 transitions, 88467 flow
[2023-10-26 08:59:49,657 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 54.125) internal successors, (1732), 32 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:59:49,657 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:59:49,657 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:59:49,664 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2023-10-26 08:59:49,861 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2023-10-26 08:59:49,862 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:59:49,862 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:59:49,863 INFO  L85        PathProgramCache]: Analyzing trace with hash 607048284, now seen corresponding path program 1 times
[2023-10-26 08:59:49,863 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:59:49,863 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273843347]
[2023-10-26 08:59:49,863 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:59:49,863 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:59:49,881 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:59:50,505 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:59:50,505 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:59:50,505 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273843347]
[2023-10-26 08:59:50,506 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273843347] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:59:50,506 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313285744]
[2023-10-26 08:59:50,506 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:59:50,506 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:59:50,506 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:59:50,507 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:59:50,556 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-10-26 08:59:50,706 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:59:50,707 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 38 conjunts are in the unsatisfiable core
[2023-10-26 08:59:50,710 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:59:50,715 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:59:50,716 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15
[2023-10-26 08:59:50,761 INFO  L321             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2023-10-26 08:59:50,762 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2023-10-26 08:59:50,904 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 08:59:50,904 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-10-26 08:59:50,942 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:59:50,943 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-10-26 08:59:50,999 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-26 08:59:51,014 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-26 08:59:51,038 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-26 08:59:51,049 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:59:51,049 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 08:59:51,072 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-10-26 08:59:51,084 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:59:51,085 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 08:59:51,102 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:59:51,102 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:59:51,134 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1150 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1150) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1150 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1150) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1150 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1150) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse0)) 0)))) is different from false
[2023-10-26 08:59:51,148 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1150 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1150) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1150 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1150) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2) 0)) (forall ((v_ArrVal_1150 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1150) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse1)) 0)))))) is different from false
[2023-10-26 08:59:51,176 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse1)) (.cse2 (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_1150 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1150) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1150 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1150) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2))) (forall ((v_ArrVal_1150 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1150) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse3) 0)))))) is different from false
[2023-10-26 08:59:51,198 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:59:51,199 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 54
[2023-10-26 08:59:51,203 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:59:51,203 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 35
[2023-10-26 08:59:51,210 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:59:51,211 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 1
[2023-10-26 08:59:51,215 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:59:51,215 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 1
[2023-10-26 08:59:51,247 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1143 (Array Int Int))) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2023-10-26 08:59:51,251 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1143 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false
[2023-10-26 08:59:51,301 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1143 (Array Int Int)) (v_ArrVal_1142 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1142) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false
[2023-10-26 08:59:51,340 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:59:51,340 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313285744] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:59:51,340 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:59:51,340 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 25
[2023-10-26 08:59:51,340 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913256193]
[2023-10-26 08:59:51,340 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:59:51,340 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-10-26 08:59:51,340 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:59:51,341 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-10-26 08:59:51,341 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=360, Unknown=10, NotChecked=258, Total=702
[2023-10-26 08:59:51,634 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 193
[2023-10-26 08:59:51,634 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 3977 transitions, 88467 flow. Second operand  has 27 states, 27 states have (on average 51.111111111111114) internal successors, (1380), 27 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:59:51,634 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:59:51,635 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 193
[2023-10-26 08:59:51,635 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:00:46,799 INFO  L130       PetriNetUnfolder]: 41034/67421 cut-off events.
[2023-10-26 09:00:46,799 INFO  L131       PetriNetUnfolder]: For 1814869/1814871 co-relation queries the response was YES.
[2023-10-26 09:00:48,116 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 682890 conditions, 67421 events. 41034/67421 cut-off events. For 1814869/1814871 co-relation queries the response was YES. Maximal size of possible extension queue 1887. Compared 535022 event pairs, 3945 based on Foata normal form. 403/67824 useless extension candidates. Maximal degree in co-relation 675470. Up to 31408 conditions per place. 
[2023-10-26 09:00:48,458 INFO  L137   encePairwiseOnDemand]: 167/193 looper letters, 4014 selfloop transitions, 1991 changer transitions 21/6028 dead transitions.
[2023-10-26 09:00:48,458 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 6028 transitions, 142488 flow
[2023-10-26 09:00:48,458 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2023-10-26 09:00:48,459 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2023-10-26 09:00:48,460 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1629 transitions.
[2023-10-26 09:00:48,461 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3246313272220008
[2023-10-26 09:00:48,462 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1629 transitions.
[2023-10-26 09:00:48,462 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1629 transitions.
[2023-10-26 09:00:48,462 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:00:48,462 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1629 transitions.
[2023-10-26 09:00:48,464 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 62.65384615384615) internal successors, (1629), 26 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:00:48,468 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 193.0) internal successors, (5211), 27 states have internal predecessors, (5211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:00:48,468 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 193.0) internal successors, (5211), 27 states have internal predecessors, (5211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:00:48,468 INFO  L175             Difference]: Start difference. First operand has 332 places, 3977 transitions, 88467 flow. Second operand 26 states and 1629 transitions.
[2023-10-26 09:00:48,469 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 6028 transitions, 142488 flow
[2023-10-26 09:02:41,485 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 6028 transitions, 141031 flow, removed 672 selfloop flow, removed 8 redundant places.
[2023-10-26 09:02:41,579 INFO  L231             Difference]: Finished difference. Result has 365 places, 4965 transitions, 117761 flow
[2023-10-26 09:02:41,582 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=87078, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3969, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1073, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2660, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=117761, PETRI_PLACES=365, PETRI_TRANSITIONS=4965}
[2023-10-26 09:02:41,582 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 303 predicate places.
[2023-10-26 09:02:41,582 INFO  L495      AbstractCegarLoop]: Abstraction has has 365 places, 4965 transitions, 117761 flow
[2023-10-26 09:02:41,583 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 51.111111111111114) internal successors, (1380), 27 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:02:41,583 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:02:41,583 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:02:41,590 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2023-10-26 09:02:41,788 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2023-10-26 09:02:41,792 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 09:02:41,792 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:02:41,792 INFO  L85        PathProgramCache]: Analyzing trace with hash -830470197, now seen corresponding path program 6 times
[2023-10-26 09:02:41,793 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:02:41,793 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144445046]
[2023-10-26 09:02:41,793 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:02:41,793 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:02:41,824 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:02:42,512 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:02:42,513 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:02:42,513 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144445046]
[2023-10-26 09:02:42,513 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144445046] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 09:02:42,513 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555000269]
[2023-10-26 09:02:42,513 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2023-10-26 09:02:42,513 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 09:02:42,513 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 09:02:42,514 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 09:02:42,536 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2023-10-26 09:02:42,675 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2023-10-26 09:02:42,675 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 09:02:42,676 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 76 conjunts are in the unsatisfiable core
[2023-10-26 09:02:42,683 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 09:02:42,719 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:02:42,721 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15
[2023-10-26 09:02:42,768 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:02:42,785 INFO  L321             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2023-10-26 09:02:42,786 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2023-10-26 09:02:42,961 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 09:02:42,962 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37
[2023-10-26 09:02:42,968 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:02:42,968 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-10-26 09:02:43,029 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-10-26 09:02:43,045 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-10-26 09:02:43,180 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-26 09:02:43,191 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2023-10-26 09:02:43,268 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 09:02:43,322 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:02:43,323 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 09:02:43,507 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:02:43,508 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:02:43,508 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 09:02:43,581 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:02:43,582 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:02:43,583 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:02:43,584 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 09:02:43,652 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:02:43,653 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:02:43,654 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:02:43,655 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56
[2023-10-26 09:02:43,713 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:02:43,714 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:02:43,714 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:02:43,716 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56
[2023-10-26 09:02:43,971 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:02:43,972 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:02:43,973 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:02:43,973 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:02:43,976 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 84
[2023-10-26 09:02:44,053 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:02:44,053 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 09:02:45,104 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1104 treesize of output 1100
[2023-10-26 09:03:12,107 WARN  L233               SmtUtils]: Spent 24.53s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2023-10-26 09:03:37,350 WARN  L233               SmtUtils]: Spent 25.06s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2023-10-26 09:03:44,343 WARN  L233               SmtUtils]: Spent 6.78s on a formula simplification. DAG size of input: 72 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2023-10-26 09:03:44,795 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~#tids~0#1.base| |c_ULTIMATE.start_main_~t~1#1.base|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~t~1#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~t~1#1.offset| 1)) (.cse2 (+ 2 |c_ULTIMATE.start_main_~t~1#1.offset|))) (or (and .cse0 (= .cse1 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (and .cse0 (= |c_ULTIMATE.start_main_~t~1#1.offset| |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (and .cse0 (= .cse2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (and .cse0 (= .cse3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse5 (forall ((v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1245 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1245) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1248) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))))) (and (or (forall ((v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1246 (Array Int Int))) (not (= .cse1 (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1246) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1247) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse5) (or .cse5 (forall ((v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1246 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~t~1#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1246) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1247) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (or (forall ((v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1246 (Array Int Int))) (not (= .cse3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1246) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1247) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse5) (or (forall ((v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1246 (Array Int Int))) (not (= .cse2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1246) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1247) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse5)))) (not (< 0 |c_ULTIMATE.start_main_~threads_total~0#1|)))) is different from false
[2023-10-26 09:03:46,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:03:46,963 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [555000269] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 09:03:46,963 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 09:03:46,963 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 16] total 42
[2023-10-26 09:03:46,963 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109532024]
[2023-10-26 09:03:46,963 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 09:03:46,963 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 44 states
[2023-10-26 09:03:46,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:03:46,964 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2023-10-26 09:03:46,964 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1584, Unknown=5, NotChecked=82, Total=1892
[2023-10-26 09:03:52,050 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 44 out of 193
[2023-10-26 09:03:52,051 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 4965 transitions, 117761 flow. Second operand  has 44 states, 44 states have (on average 45.75) internal successors, (2013), 44 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:03:52,051 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:03:52,051 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 193
[2023-10-26 09:03:52,051 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
