./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_94-alloc_region_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d2ba6107 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_94-alloc_region_racing.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7faac9952fd378b53dcd8f21391daa9cc75834f7be2a5ad0c70d96fc8524bd08 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-d2ba610-m [2023-11-21 21:49:01,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 21:49:01,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-21 21:49:01,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 21:49:01,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 21:49:01,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 21:49:01,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 21:49:01,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 21:49:01,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 21:49:01,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 21:49:01,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 21:49:01,197 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 21:49:01,198 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 21:49:01,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 21:49:01,199 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 21:49:01,200 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 21:49:01,200 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 21:49:01,200 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 21:49:01,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 21:49:01,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 21:49:01,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 21:49:01,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 21:49:01,201 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 21:49:01,201 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 21:49:01,202 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 21:49:01,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 21:49:01,202 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 21:49:01,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 21:49:01,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 21:49:01,203 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-21 21:49:01,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 21:49:01,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:49:01,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 21:49:01,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 21:49:01,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 21:49:01,205 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 21:49:01,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 21:49:01,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 21:49:01,205 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-21 21:49:01,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-21 21:49:01,206 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 21:49:01,206 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-21 21:49:01,206 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-21 21:49:01,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-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 -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> GemCutter 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 -> 7faac9952fd378b53dcd8f21391daa9cc75834f7be2a5ad0c70d96fc8524bd08 [2023-11-21 21:49:01,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 21:49:01,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 21:49:01,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 21:49:01,457 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 21:49:01,457 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 21:49:01,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_94-alloc_region_racing.i [2023-11-21 21:49:02,485 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 21:49:02,752 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 21:49:02,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_94-alloc_region_racing.i [2023-11-21 21:49:02,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/db161352f/5abf5b1a128647c18ac7f404212f6a0b/FLAGc95185c60 [2023-11-21 21:49:02,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/db161352f/5abf5b1a128647c18ac7f404212f6a0b [2023-11-21 21:49:02,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 21:49:02,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 21:49:02,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 21:49:02,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 21:49:02,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 21:49:02,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:49:02" (1/1) ... [2023-11-21 21:49:02,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a59c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:49:02, skipping insertion in model container [2023-11-21 21:49:02,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:49:02" (1/1) ... [2023-11-21 21:49:02,854 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 21:49:03,246 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:49:03,255 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 21:49:03,291 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:49:03,353 INFO L206 MainTranslator]: Completed translation [2023-11-21 21:49:03,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:49:03 WrapperNode [2023-11-21 21:49:03,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 21:49:03,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 21:49:03,355 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 21:49:03,355 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 21:49:03,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:49:03" (1/1) ... [2023-11-21 21:49:03,390 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:49:03" (1/1) ... [2023-11-21 21:49:03,441 INFO L138 Inliner]: procedures = 378, calls = 83, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 445 [2023-11-21 21:49:03,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 21:49:03,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 21:49:03,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 21:49:03,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 21:49:03,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:49:03" (1/1) ... [2023-11-21 21:49:03,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:49:03" (1/1) ... [2023-11-21 21:49:03,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:49:03" (1/1) ... [2023-11-21 21:49:03,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:49:03" (1/1) ... [2023-11-21 21:49:03,487 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:49:03" (1/1) ... [2023-11-21 21:49:03,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:49:03" (1/1) ... [2023-11-21 21:49:03,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:49:03" (1/1) ... [2023-11-21 21:49:03,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:49:03" (1/1) ... [2023-11-21 21:49:03,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 21:49:03,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 21:49:03,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 21:49:03,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 21:49:03,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:49:03" (1/1) ... [2023-11-21 21:49:03,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:49:03,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:49:03,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 21:49:03,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 21:49:03,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 21:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-21 21:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 21:49:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-21 21:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-21 21:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 21:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 21:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-21 21:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 21:49:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 21:49:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-21 21:49:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-21 21:49:03,605 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-21 21:49:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 21:49:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 21:49:03,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 21:49:03,607 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 21:49:03,791 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 21:49:03,793 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 21:49:04,388 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 21:49:04,434 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 21:49:04,435 INFO L308 CfgBuilder]: Removed 23 assume(true) statements. [2023-11-21 21:49:04,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:49:04 BoogieIcfgContainer [2023-11-21 21:49:04,437 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 21:49:04,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 21:49:04,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 21:49:04,442 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 21:49:04,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:49:02" (1/3) ... [2023-11-21 21:49:04,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73539601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:49:04, skipping insertion in model container [2023-11-21 21:49:04,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:49:03" (2/3) ... [2023-11-21 21:49:04,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73539601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:49:04, skipping insertion in model container [2023-11-21 21:49:04,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:49:04" (3/3) ... [2023-11-21 21:49:04,447 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_94-alloc_region_racing.i [2023-11-21 21:49:04,454 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 21:49:04,461 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 21:49:04,461 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2023-11-21 21:49:04,462 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 21:49:04,534 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-21 21:49:04,575 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:49:04,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 21:49:04,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:49:04,577 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 21:49:04,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-21 21:49:04,617 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 21:49:04,625 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-11-21 21:49:04,630 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5fd45ced, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:49:04,630 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-21 21:49:05,002 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:49:05,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:05,007 INFO L85 PathProgramCache]: Analyzing trace with hash 422928666, now seen corresponding path program 1 times [2023-11-21 21:49:05,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:05,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992144096] [2023-11-21 21:49:05,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:05,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:05,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:05,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:05,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992144096] [2023-11-21 21:49:05,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992144096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:49:05,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:49:05,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:49:05,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710884539] [2023-11-21 21:49:05,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:49:05,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:49:05,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:05,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:49:05,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:49:05,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:05,967 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:05,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 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-11-21 21:49:05,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:06,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:06,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 21:49:06,188 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:49:06,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:06,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1121700833, now seen corresponding path program 1 times [2023-11-21 21:49:06,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:06,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620033268] [2023-11-21 21:49:06,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:06,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:06,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:06,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620033268] [2023-11-21 21:49:06,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620033268] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:49:06,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:49:06,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:49:06,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720954008] [2023-11-21 21:49:06,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:49:06,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:49:06,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:06,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:49:06,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:49:06,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:06,654 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:06,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 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-11-21 21:49:06,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:06,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:06,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:06,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:06,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 21:49:06,855 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:49:06,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:06,855 INFO L85 PathProgramCache]: Analyzing trace with hash -947860740, now seen corresponding path program 1 times [2023-11-21 21:49:06,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:06,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201488900] [2023-11-21 21:49:06,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:06,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:07,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:07,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201488900] [2023-11-21 21:49:07,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201488900] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:49:07,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:49:07,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:49:07,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369390595] [2023-11-21 21:49:07,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:49:07,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:49:07,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:07,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:49:07,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:49:07,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:07,348 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:07,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.4) internal successors, (117), 6 states have internal predecessors, (117), 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-11-21 21:49:07,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:07,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:07,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:07,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:07,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:07,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:07,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 21:49:07,499 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:49:07,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:07,500 INFO L85 PathProgramCache]: Analyzing trace with hash 53001611, now seen corresponding path program 1 times [2023-11-21 21:49:07,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:07,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778154990] [2023-11-21 21:49:07,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:07,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:07,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:07,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:07,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778154990] [2023-11-21 21:49:07,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778154990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:49:07,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:49:07,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:49:07,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303532080] [2023-11-21 21:49:07,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:49:07,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:49:07,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:07,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:49:07,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:49:07,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:07,913 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:07,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 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-11-21 21:49:07,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:07,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:07,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:07,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:08,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:08,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:08,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:08,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 21:49:08,125 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:49:08,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:08,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1150850725, now seen corresponding path program 1 times [2023-11-21 21:49:08,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:08,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730247558] [2023-11-21 21:49:08,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:08,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:08,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:08,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730247558] [2023-11-21 21:49:08,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730247558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:49:08,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:49:08,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:49:08,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852664421] [2023-11-21 21:49:08,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:49:08,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:49:08,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:08,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:49:08,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:49:08,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:08,538 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:08,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.6) internal successors, (133), 6 states have internal predecessors, (133), 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-11-21 21:49:08,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:08,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:08,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:08,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:08,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:08,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:08,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:08,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:08,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:08,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:08,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 21:49:08,816 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:49:08,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:08,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1234164351, now seen corresponding path program 1 times [2023-11-21 21:49:08,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:08,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869584682] [2023-11-21 21:49:08,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:08,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:09,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:09,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:09,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869584682] [2023-11-21 21:49:09,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869584682] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:49:09,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:49:09,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:49:09,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859488206] [2023-11-21 21:49:09,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:49:09,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:49:09,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:09,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:49:09,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:49:09,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:09,260 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:09,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.6) internal successors, (153), 6 states have internal predecessors, (153), 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-11-21 21:49:09,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:09,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:09,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:09,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:09,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:09,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:09,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:09,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:09,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:09,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:09,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:09,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:09,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 21:49:09,528 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:49:09,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:09,529 INFO L85 PathProgramCache]: Analyzing trace with hash -316634735, now seen corresponding path program 1 times [2023-11-21 21:49:09,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:09,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693125249] [2023-11-21 21:49:09,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:09,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:09,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:09,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:09,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693125249] [2023-11-21 21:49:09,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693125249] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:49:09,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:49:09,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:49:09,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075801502] [2023-11-21 21:49:09,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:49:09,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:49:09,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:09,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:49:09,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:49:09,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:10,000 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:10,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.2) internal successors, (161), 6 states have internal predecessors, (161), 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-11-21 21:49:10,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:10,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 21:49:10,315 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:49:10,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:10,315 INFO L85 PathProgramCache]: Analyzing trace with hash -525539526, now seen corresponding path program 1 times [2023-11-21 21:49:10,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:10,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114274401] [2023-11-21 21:49:10,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:10,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:10,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:10,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114274401] [2023-11-21 21:49:10,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114274401] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:49:10,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:49:10,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:49:10,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52677443] [2023-11-21 21:49:10,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:49:10,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:49:10,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:10,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:49:10,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:49:10,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:10,754 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:10,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 36.6) internal successors, (183), 6 states have internal predecessors, (183), 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-11-21 21:49:10,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:10,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:10,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 21:49:10,995 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:49:10,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:10,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1327062415, now seen corresponding path program 1 times [2023-11-21 21:49:10,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:10,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386509410] [2023-11-21 21:49:10,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:10,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:11,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:11,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386509410] [2023-11-21 21:49:11,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386509410] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:49:11,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862257087] [2023-11-21 21:49:11,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:11,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:49:11,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:49:11,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:49:11,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 21:49:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:11,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 21:49:11,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:49:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:11,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:49:11,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:11,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862257087] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:49:11,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:49:11,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-21 21:49:11,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628123064] [2023-11-21 21:49:11,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:49:11,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-21 21:49:11,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:11,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-21 21:49:11,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-21 21:49:11,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:11,717 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:11,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 42.8) internal successors, (428), 10 states have internal predecessors, (428), 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-11-21 21:49:11,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:11,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:11,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:11,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:11,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:11,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:11,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:11,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:11,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:12,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:12,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:12,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:12,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:12,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:12,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (9 of 10 remaining) [2023-11-21 21:49:12,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2023-11-21 21:49:12,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2023-11-21 21:49:12,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2023-11-21 21:49:12,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2023-11-21 21:49:12,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr9ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2023-11-21 21:49:12,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2023-11-21 21:49:12,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr7ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2023-11-21 21:49:12,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr6ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2023-11-21 21:49:12,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr8ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2023-11-21 21:49:12,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 21:49:12,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-21 21:49:12,336 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:49:12,338 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-11-21 21:49:12,342 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:49:12,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 21:49:12,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:49:12,343 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 21:49:12,346 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 21:49:12,346 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-21 21:49:12,346 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5fd45ced, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:49:12,347 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-11-21 21:49:12,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2023-11-21 21:49:12,358 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-21 21:49:12,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:12,358 INFO L85 PathProgramCache]: Analyzing trace with hash 448759098, now seen corresponding path program 1 times [2023-11-21 21:49:12,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:12,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771925855] [2023-11-21 21:49:12,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:12,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:12,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:12,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771925855] [2023-11-21 21:49:12,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771925855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:49:12,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:49:12,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:49:12,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141860654] [2023-11-21 21:49:12,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:49:12,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:49:12,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:12,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:49:12,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:49:12,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:12,508 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:12,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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-11-21 21:49:12,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:12,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 21:49:12,530 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-21 21:49:12,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:12,531 INFO L85 PathProgramCache]: Analyzing trace with hash 341592347, now seen corresponding path program 1 times [2023-11-21 21:49:12,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:12,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100240566] [2023-11-21 21:49:12,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:12,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:12,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:12,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:12,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100240566] [2023-11-21 21:49:12,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100240566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:49:12,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:49:12,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:49:12,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212493648] [2023-11-21 21:49:12,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:49:12,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:49:12,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:12,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:49:12,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:49:12,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:12,682 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:12,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 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-11-21 21:49:12,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:12,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:12,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:12,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:12,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 21:49:12,718 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-21 21:49:12,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:12,719 INFO L85 PathProgramCache]: Analyzing trace with hash -656843951, now seen corresponding path program 1 times [2023-11-21 21:49:12,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:12,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745358690] [2023-11-21 21:49:12,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:12,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:12,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:12,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745358690] [2023-11-21 21:49:12,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745358690] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:49:12,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:49:12,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:49:12,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492581855] [2023-11-21 21:49:12,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:49:12,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:49:12,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:12,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:49:12,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:49:12,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:12,894 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:12,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 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-11-21 21:49:12,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:12,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:12,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:12,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 21:49:12,935 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-21 21:49:12,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:12,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1691140256, now seen corresponding path program 1 times [2023-11-21 21:49:12,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:12,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235745472] [2023-11-21 21:49:12,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:12,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:13,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:13,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235745472] [2023-11-21 21:49:13,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235745472] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:49:13,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:49:13,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:49:13,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654587392] [2023-11-21 21:49:13,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:49:13,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:49:13,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:13,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:49:13,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:49:13,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:13,115 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:13,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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-11-21 21:49:13,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:13,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:13,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:13,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:13,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:13,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:13,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:13,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:13,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 21:49:13,313 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-21 21:49:13,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:13,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1002352148, now seen corresponding path program 1 times [2023-11-21 21:49:13,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:13,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883254255] [2023-11-21 21:49:13,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:13,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:49:13,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:49:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:49:13,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:49:13,366 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 21:49:13,367 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2023-11-21 21:49:13,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2023-11-21 21:49:13,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2023-11-21 21:49:13,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2023-11-21 21:49:13,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2023-11-21 21:49:13,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2023-11-21 21:49:13,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2023-11-21 21:49:13,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2023-11-21 21:49:13,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2023-11-21 21:49:13,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2023-11-21 21:49:13,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2023-11-21 21:49:13,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining) [2023-11-21 21:49:13,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2023-11-21 21:49:13,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2023-11-21 21:49:13,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2023-11-21 21:49:13,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2023-11-21 21:49:13,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2023-11-21 21:49:13,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2023-11-21 21:49:13,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2023-11-21 21:49:13,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 21:49:13,372 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-21 21:49:13,372 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-11-21 21:49:13,373 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-21 21:49:13,373 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-21 21:49:13,421 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-21 21:49:13,425 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:49:13,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 21:49:13,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:49:13,427 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 21:49:13,432 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 21:49:13,432 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2023-11-21 21:49:13,433 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5fd45ced, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:49:13,433 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-21 21:49:13,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2023-11-21 21:49:13,609 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:49:13,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:13,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1822238038, now seen corresponding path program 1 times [2023-11-21 21:49:13,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:13,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39824989] [2023-11-21 21:49:13,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:13,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:13,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:13,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39824989] [2023-11-21 21:49:13,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39824989] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:49:13,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:49:13,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:49:13,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003094093] [2023-11-21 21:49:13,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:49:13,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:49:13,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:13,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:49:13,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:49:13,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:13,816 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:13,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 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-11-21 21:49:13,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:13,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:13,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 21:49:13,967 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:49:13,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:13,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1324179163, now seen corresponding path program 1 times [2023-11-21 21:49:13,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:13,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836653153] [2023-11-21 21:49:13,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:13,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:14,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:14,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:14,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836653153] [2023-11-21 21:49:14,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836653153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:49:14,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:49:14,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:49:14,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711236459] [2023-11-21 21:49:14,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:49:14,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:49:14,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:14,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:49:14,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:49:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:14,251 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:14,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 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-11-21 21:49:14,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:14,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:14,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:14,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:14,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-21 21:49:14,369 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:49:14,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:14,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1135453435, now seen corresponding path program 1 times [2023-11-21 21:49:14,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:14,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890183777] [2023-11-21 21:49:14,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:14,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:14,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:14,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:14,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890183777] [2023-11-21 21:49:14,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890183777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:49:14,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:49:14,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:49:14,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082323890] [2023-11-21 21:49:14,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:49:14,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:49:14,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:14,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:49:14,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:49:14,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:14,675 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:14,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.4) internal successors, (117), 6 states have internal predecessors, (117), 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-11-21 21:49:14,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:14,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:14,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:14,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:14,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:14,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:14,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-21 21:49:14,879 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:49:14,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:14,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1232339417, now seen corresponding path program 1 times [2023-11-21 21:49:14,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:14,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245662248] [2023-11-21 21:49:14,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:14,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:15,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:15,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:15,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245662248] [2023-11-21 21:49:15,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245662248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:49:15,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:49:15,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:49:15,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243019268] [2023-11-21 21:49:15,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:49:15,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:49:15,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:15,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:49:15,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:49:15,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:15,152 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:15,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 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-11-21 21:49:15,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:15,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:15,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:15,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:15,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:15,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:15,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-21 21:49:15,291 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:49:15,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:15,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2068891218, now seen corresponding path program 1 times [2023-11-21 21:49:15,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:15,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316775931] [2023-11-21 21:49:15,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:15,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:15,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:15,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:15,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316775931] [2023-11-21 21:49:15,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316775931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:49:15,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:49:15,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:49:15,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574968542] [2023-11-21 21:49:15,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:49:15,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:49:15,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:15,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:49:15,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:49:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:15,644 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:15,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.6) internal successors, (133), 6 states have internal predecessors, (133), 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-11-21 21:49:15,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:15,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:15,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:15,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:15,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:15,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:15,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:15,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:15,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-21 21:49:15,874 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:49:15,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:15,874 INFO L85 PathProgramCache]: Analyzing trace with hash -600283832, now seen corresponding path program 1 times [2023-11-21 21:49:15,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:15,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353514951] [2023-11-21 21:49:15,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:15,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:16,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:16,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353514951] [2023-11-21 21:49:16,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353514951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:49:16,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:49:16,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:49:16,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924289540] [2023-11-21 21:49:16,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:49:16,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:49:16,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:16,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:49:16,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:49:16,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:16,253 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:16,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.6) internal successors, (153), 6 states have internal predecessors, (153), 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-11-21 21:49:16,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:16,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:16,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:16,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:16,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:16,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:16,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:16,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:16,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:16,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:16,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:16,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:16,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-21 21:49:16,433 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:49:16,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:16,433 INFO L85 PathProgramCache]: Analyzing trace with hash 364223962, now seen corresponding path program 1 times [2023-11-21 21:49:16,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:16,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797689370] [2023-11-21 21:49:16,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:16,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:16,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:16,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797689370] [2023-11-21 21:49:16,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797689370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:49:16,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:49:16,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:49:16,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697837853] [2023-11-21 21:49:16,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:49:16,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:49:16,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:16,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:49:16,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:49:16,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:16,810 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:16,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.2) internal successors, (161), 6 states have internal predecessors, (161), 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-11-21 21:49:16,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:16,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:16,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:16,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:16,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:16,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:16,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:17,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:17,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:17,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:17,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:17,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:17,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:17,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:17,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-21 21:49:17,133 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:49:17,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:17,133 INFO L85 PathProgramCache]: Analyzing trace with hash 845724067, now seen corresponding path program 1 times [2023-11-21 21:49:17,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:17,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610345736] [2023-11-21 21:49:17,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:17,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:49:17,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:17,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610345736] [2023-11-21 21:49:17,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610345736] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:49:17,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:49:17,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:49:17,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998763145] [2023-11-21 21:49:17,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:49:17,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:49:17,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:17,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:49:17,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:49:17,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:17,494 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:17,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 36.6) internal successors, (183), 6 states have internal predecessors, (183), 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-11-21 21:49:17,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:17,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:17,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:17,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:17,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:17,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:17,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:17,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:18,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:18,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:18,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:18,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:18,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:18,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:18,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:18,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:18,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-21 21:49:18,676 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:49:18,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:18,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1043385511, now seen corresponding path program 1 times [2023-11-21 21:49:18,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:18,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644805466] [2023-11-21 21:49:18,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:18,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:49:19,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:19,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644805466] [2023-11-21 21:49:19,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644805466] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:49:19,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:49:19,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-21 21:49:19,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891229851] [2023-11-21 21:49:19,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:49:19,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-21 21:49:19,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:19,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-21 21:49:19,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-11-21 21:49:19,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:19,533 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:19,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 15.76923076923077) internal successors, (205), 14 states have internal predecessors, (205), 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-11-21 21:49:19,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:19,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:19,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:19,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:19,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:19,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:19,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:19,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:19,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:20,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:20,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:20,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:20,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:20,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:20,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:20,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:20,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:20,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:49:20,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-21 21:49:20,735 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:49:20,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:20,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1737587570, now seen corresponding path program 1 times [2023-11-21 21:49:20,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:20,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331977395] [2023-11-21 21:49:20,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:20,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:49:22,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:22,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331977395] [2023-11-21 21:49:22,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331977395] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:49:22,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585168275] [2023-11-21 21:49:22,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:22,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:49:22,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:49:22,561 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:49:22,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 21:49:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:22,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-21 21:49:22,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:49:23,023 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-21 21:49:23,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-21 21:49:23,231 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 21:49:23,232 INFO L378 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 14 treesize of output 13 [2023-11-21 21:49:23,315 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 21:49:23,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 25 [2023-11-21 21:49:24,396 INFO L378 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-11-21 21:49:24,448 INFO L378 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-11-21 21:49:24,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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-11-21 21:49:24,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-11-21 21:49:25,129 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2023-11-21 21:49:25,129 INFO L378 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 26 [2023-11-21 21:49:25,482 INFO L378 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 43 treesize of output 32 [2023-11-21 21:49:25,504 INFO L378 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 43 treesize of output 32 [2023-11-21 21:49:25,534 INFO L378 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 43 treesize of output 32 [2023-11-21 21:49:25,561 INFO L378 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 43 treesize of output 32 [2023-11-21 21:49:25,665 INFO L378 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 43 treesize of output 32 [2023-11-21 21:49:25,691 INFO L378 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 43 treesize of output 32 [2023-11-21 21:49:25,707 INFO L378 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 43 treesize of output 32 [2023-11-21 21:49:25,737 INFO L378 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 43 treesize of output 32 [2023-11-21 21:49:25,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2023-11-21 21:49:26,064 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:49:26,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:49:33,368 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3235 (Array Int Int)) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_37| Int)) (or (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_37|) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse0 (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_3235))) (store .cse0 |c_~#A~0.base| (store (select .cse0 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_37| 0))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1))))) (forall ((v_ArrVal_3235 (Array Int Int)) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_37| Int)) (or (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_37|) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse1 (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_3235))) (store .cse1 |c_~#A~0.base| (store (select .cse1 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_37| 0))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) (forall ((v_ArrVal_3235 (Array Int Int)) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_37| Int)) (or (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_37|) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse2 (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_3235))) (store .cse2 |c_~#A~0.base| (store (select .cse2 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_37| 0))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) (forall ((v_ArrVal_3235 (Array Int Int)) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_37| Int)) (or (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_37|) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse3 (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_3235))) (store .cse3 |c_~#A~0.base| (store (select .cse3 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_37| 0))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2023-11-21 21:49:33,657 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3235 (Array Int Int)) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_37| Int)) (or (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_37|) (= (select (select (let ((.cse0 (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_3235))) (store .cse0 |c_~#A~0.base| (store (select .cse0 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_37| 0))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) |c_t_funThread1of2ForFork0_#t~nondet49#1|))) (forall ((v_ArrVal_3235 (Array Int Int)) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_37| Int)) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse1 (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_3235))) (store .cse1 |c_~#A~0.base| (store (select .cse1 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_37| 0))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1))) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_37|))) (forall ((v_ArrVal_3235 (Array Int Int)) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_37| Int)) (or (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_37|) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse2 (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_3235))) (store .cse2 |c_~#A~0.base| (store (select .cse2 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_37| 0))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) (forall ((v_ArrVal_3235 (Array Int Int)) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_37| Int)) (or (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_37|) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse3 (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_3235))) (store .cse3 |c_~#A~0.base| (store (select .cse3 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_37| 0))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2023-11-21 21:49:33,714 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3235 (Array Int Int)) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_37| Int)) (or (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_37|) (= (select (select (let ((.cse0 (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_3235))) (store .cse0 |c_~#A~0.base| (store (select .cse0 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_37| 0))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) |c_t_funThread1of2ForFork0_#t~nondet49#1|))) (forall ((v_ArrVal_3235 (Array Int Int)) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_37| Int)) (or (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_37|) (= (select (select (let ((.cse1 (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_3235))) (store .cse1 |c_~#A~0.base| (store (select .cse1 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_37| 0))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of2ForFork0_#t~nondet49#1|))) (forall ((v_ArrVal_3235 (Array Int Int)) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_37| Int)) (or (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_37|) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse2 (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_3235))) (store .cse2 |c_~#A~0.base| (store (select .cse2 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_37| 0))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) (forall ((v_ArrVal_3235 (Array Int Int)) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_37| Int)) (or (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_37|) (= (select (select (let ((.cse3 (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_3235))) (store .cse3 |c_~#A~0.base| (store (select .cse3 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_37| 0))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) |c_t_funThread1of2ForFork0_#t~nondet49#1|)))) is different from false [2023-11-21 21:49:33,758 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3235 (Array Int Int)) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_37| Int)) (or (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_37|) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse0 (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_3235))) (store .cse0 |c_~#A~0.base| (store (select .cse0 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_37| 0))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) (forall ((v_ArrVal_3235 (Array Int Int)) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_37| Int)) (or (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_37|) (= (select (select (let ((.cse1 (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_3235))) (store .cse1 |c_~#A~0.base| (store (select .cse1 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_37| 0))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) |c_t_funThread1of2ForFork0_#t~nondet49#1|))) (forall ((v_ArrVal_3235 (Array Int Int)) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_37| Int)) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse2 (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_3235))) (store .cse2 |c_~#A~0.base| (store (select .cse2 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_37| 0))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_37|))) (forall ((v_ArrVal_3235 (Array Int Int)) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_37| Int)) (or (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_37|) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse3 (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_3235))) (store .cse3 |c_~#A~0.base| (store (select .cse3 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_37| 0))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))))) is different from false [2023-11-21 21:49:36,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:49:36,636 INFO L378 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 4 case distinctions, treesize of input 69 treesize of output 62 [2023-11-21 21:49:36,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:49:36,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 240 treesize of output 212 [2023-11-21 21:49:36,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 173 treesize of output 157 [2023-11-21 21:49:36,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:49:36,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 61 [2023-11-21 21:49:36,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:49:36,770 INFO L378 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 4 case distinctions, treesize of input 69 treesize of output 62 [2023-11-21 21:49:36,772 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:49:36,777 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 21:49:36,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 128 treesize of output 106 [2023-11-21 21:49:36,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 32 [2023-11-21 21:49:36,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:49:36,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 100 treesize of output 70 [2023-11-21 21:49:36,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:49:36,814 INFO L378 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 4 case distinctions, treesize of input 69 treesize of output 62 [2023-11-21 21:49:36,816 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:49:36,822 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 21:49:36,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 108 treesize of output 94 [2023-11-21 21:49:36,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 40 treesize of output 36 [2023-11-21 21:49:36,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:49:36,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 100 treesize of output 66 [2023-11-21 21:49:36,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:49:36,862 INFO L378 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 4 case distinctions, treesize of input 67 treesize of output 60 [2023-11-21 21:49:36,864 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:49:36,870 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 21:49:36,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 132 treesize of output 110 [2023-11-21 21:49:36,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 32 [2023-11-21 21:49:36,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:49:36,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 62 [2023-11-21 21:49:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:49:45,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585168275] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:49:45,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:49:45,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 54 [2023-11-21 21:49:45,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265906807] [2023-11-21 21:49:45,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:49:45,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-21 21:49:45,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:49:45,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-21 21:49:45,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2289, Unknown=23, NotChecked=404, Total=2970 [2023-11-21 21:49:45,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:45,805 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:49:45,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 12.148148148148149) internal successors, (656), 55 states have internal predecessors, (656), 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-11-21 21:49:45,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:45,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:45,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:45,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:45,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:45,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:45,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:45,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:45,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:49:45,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:49:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:55,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:55,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:55,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:49:55,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:49:55,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-21 21:49:55,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-21 21:49:55,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-21 21:49:55,889 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:49:55,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:49:55,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1029957784, now seen corresponding path program 1 times [2023-11-21 21:49:55,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:49:55,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944054965] [2023-11-21 21:49:55,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:55,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:49:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:49:57,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:49:57,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944054965] [2023-11-21 21:49:57,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944054965] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:49:57,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180182492] [2023-11-21 21:49:57,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:49:57,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:49:57,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:49:57,733 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:49:57,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-21 21:49:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:49:58,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 81 conjunts are in the unsatisfiable core [2023-11-21 21:49:58,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:49:58,198 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-21 21:49:58,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-21 21:49:58,210 INFO L378 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 1 [2023-11-21 21:49:58,268 INFO L378 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 16 treesize of output 8 [2023-11-21 21:49:58,410 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 21:49:58,410 INFO L378 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 14 treesize of output 13 [2023-11-21 21:49:58,490 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 21:49:58,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 25 [2023-11-21 21:49:59,347 INFO L378 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-11-21 21:49:59,401 INFO L378 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-11-21 21:49:59,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:49:59,460 INFO L378 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-11-21 21:49:59,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:49:59,529 INFO L378 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-11-21 21:49:59,974 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2023-11-21 21:49:59,975 INFO L378 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 26 [2023-11-21 21:50:00,329 INFO L378 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 43 treesize of output 32 [2023-11-21 21:50:00,358 INFO L378 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 43 treesize of output 32 [2023-11-21 21:50:00,380 INFO L378 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 43 treesize of output 32 [2023-11-21 21:50:00,409 INFO L378 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 43 treesize of output 32 [2023-11-21 21:50:00,507 INFO L378 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 43 treesize of output 32 [2023-11-21 21:50:00,531 INFO L378 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 43 treesize of output 32 [2023-11-21 21:50:00,550 INFO L378 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 43 treesize of output 32 [2023-11-21 21:50:00,577 INFO L378 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 43 treesize of output 32 [2023-11-21 21:50:00,942 INFO L378 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 43 treesize of output 32 [2023-11-21 21:50:00,964 INFO L378 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 43 treesize of output 32 [2023-11-21 21:50:00,985 INFO L378 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 43 treesize of output 32 [2023-11-21 21:50:01,004 INFO L378 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 43 treesize of output 32 [2023-11-21 21:50:01,116 INFO L378 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 43 treesize of output 32 [2023-11-21 21:50:01,163 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:50:01,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:50:01,187 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3746 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_3746) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_3746 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_3746) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_3746 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_3746) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_3746 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_3746) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) is different from false [2023-11-21 21:50:01,230 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3745 (Array Int Int)) (v_ArrVal_3746 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_3745) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_3746) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_3745 (Array Int Int)) (v_ArrVal_3746 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_3745) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_3746) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_3745 (Array Int Int)) (v_ArrVal_3746 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_3745) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_3746) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_3745 (Array Int Int)) (v_ArrVal_3746 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_3745) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_3746) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2023-11-21 21:50:01,400 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3745 (Array Int Int)) (v_ArrVal_3746 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_3745) |c_t_funThread2of2ForFork0_insert_#in~p#1.base| v_ArrVal_3746) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_3745 (Array Int Int)) (v_ArrVal_3746 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_3745) |c_t_funThread2of2ForFork0_insert_#in~p#1.base| v_ArrVal_3746) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_3745 (Array Int Int)) (v_ArrVal_3746 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_3745) |c_t_funThread2of2ForFork0_insert_#in~p#1.base| v_ArrVal_3746) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_3745 (Array Int Int)) (v_ArrVal_3746 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_3745) |c_t_funThread2of2ForFork0_insert_#in~p#1.base| v_ArrVal_3746) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) is different from false [2023-11-21 21:50:06,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:50:06,906 INFO L378 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 4 case distinctions, treesize of input 36 treesize of output 52 [2023-11-21 21:50:06,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:50:06,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 56 [2023-11-21 21:50:06,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 [2023-11-21 21:50:06,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 38 treesize of output 34 [2023-11-21 21:50:06,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:50:06,944 INFO L378 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 4 case distinctions, treesize of input 38 treesize of output 54 [2023-11-21 21:50:06,947 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:50:06,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:50:06,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 32 [2023-11-21 21:50:06,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:50:06,965 INFO L378 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 4 case distinctions, treesize of input 38 treesize of output 54 [2023-11-21 21:50:06,968 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:50:06,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:50:06,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 32 [2023-11-21 21:50:06,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:50:06,989 INFO L378 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 4 case distinctions, treesize of input 38 treesize of output 54 [2023-11-21 21:50:06,991 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:50:06,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:50:06,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 32 [2023-11-21 21:50:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:50:12,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180182492] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:50:12,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:50:12,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25, 19] total 58 [2023-11-21 21:50:12,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671005600] [2023-11-21 21:50:12,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:50:12,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-11-21 21:50:12,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:50:12,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-11-21 21:50:12,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=2641, Unknown=163, NotChecked=330, Total=3422 [2023-11-21 21:50:12,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:50:12,325 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:50:12,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 10.982758620689655) internal successors, (637), 59 states have internal predecessors, (637), 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-11-21 21:50:12,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:12,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:12,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:12,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:12,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:12,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:12,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:12,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:12,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:50:12,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-11-21 21:50:12,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:50:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:50:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-21 21:50:47,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:50:47,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-21 21:50:47,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-21 21:50:47,689 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:50:47,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:50:47,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2009072898, now seen corresponding path program 1 times [2023-11-21 21:50:47,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:50:47,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708829013] [2023-11-21 21:50:47,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:50:47,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:50:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:50:47,845 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:50:47,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:50:47,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708829013] [2023-11-21 21:50:47,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708829013] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:50:47,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597220786] [2023-11-21 21:50:47,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:50:47,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:50:47,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:50:47,847 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:50:47,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-21 21:50:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:50:48,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-21 21:50:48,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:50:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:50:48,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:50:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:50:48,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597220786] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:50:48,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:50:48,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-11-21 21:50:48,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206265986] [2023-11-21 21:50:48,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:50:48,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-21 21:50:48,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:50:48,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-21 21:50:48,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-21 21:50:48,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:50:48,578 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:50:48,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 32.0) internal successors, (448), 14 states have internal predecessors, (448), 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-11-21 21:50:48,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:48,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:48,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:48,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:48,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:48,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:48,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:48,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:50:48,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:50:48,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-11-21 21:50:48,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:50:48,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:51:04,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:04,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:04,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:04,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:04,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:04,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:04,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:04,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:04,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:51:04,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-21 21:51:04,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:51:04,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:51:04,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-21 21:51:04,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-21 21:51:04,952 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:51:04,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:51:04,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1630381713, now seen corresponding path program 2 times [2023-11-21 21:51:04,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:51:04,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809612746] [2023-11-21 21:51:04,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:51:04,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:51:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:51:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:51:05,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:51:05,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809612746] [2023-11-21 21:51:05,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809612746] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:51:05,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:51:05,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-21 21:51:05,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755474286] [2023-11-21 21:51:05,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:51:05,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-21 21:51:05,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:51:05,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-21 21:51:05,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-11-21 21:51:05,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:51:05,759 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:51:05,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 15.76923076923077) internal successors, (205), 14 states have internal predecessors, (205), 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-11-21 21:51:05,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:05,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:05,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:05,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:05,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:05,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:05,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:05,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:05,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:51:05,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-11-21 21:51:05,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:51:05,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:51:05,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:51:07,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:07,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:07,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:07,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:07,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:07,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:07,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:51:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-21 21:51:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:51:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:51:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-21 21:51:07,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-21 21:51:07,938 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:51:07,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:51:07,938 INFO L85 PathProgramCache]: Analyzing trace with hash 2055593116, now seen corresponding path program 2 times [2023-11-21 21:51:07,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:51:07,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210298163] [2023-11-21 21:51:07,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:51:07,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:51:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:51:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:51:09,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:51:09,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210298163] [2023-11-21 21:51:09,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210298163] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:51:09,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284184709] [2023-11-21 21:51:09,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 21:51:09,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:51:09,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:51:09,448 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:51:09,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-21 21:51:10,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 21:51:10,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 21:51:10,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-21 21:51:10,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:51:10,890 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-21 21:51:10,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-21 21:51:10,986 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 21:51:10,986 INFO L378 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 14 treesize of output 13 [2023-11-21 21:51:11,051 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 21:51:11,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 25 [2023-11-21 21:51:11,994 INFO L378 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-11-21 21:51:12,042 INFO L378 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 19 treesize of output 18 [2023-11-21 21:51:12,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 21:51:12,593 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2023-11-21 21:51:12,593 INFO L378 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 26 [2023-11-21 21:51:12,940 INFO L378 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 30 treesize of output 21 [2023-11-21 21:51:12,963 INFO L378 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 33 treesize of output 38 [2023-11-21 21:51:13,036 INFO L378 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 37 treesize of output 26 [2023-11-21 21:51:13,061 INFO L378 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 37 treesize of output 26 [2023-11-21 21:51:13,083 INFO L378 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 37 treesize of output 26 [2023-11-21 21:51:13,184 INFO L378 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 37 treesize of output 26 [2023-11-21 21:51:13,205 INFO L378 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 37 treesize of output 26 [2023-11-21 21:51:13,228 INFO L378 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 37 treesize of output 26 [2023-11-21 21:51:13,261 INFO L378 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 37 treesize of output 26 [2023-11-21 21:51:13,527 INFO L378 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 37 treesize of output 26 [2023-11-21 21:51:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:51:13,568 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:51:13,593 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4822 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_4822 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_4822 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_4822 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) is different from false [2023-11-21 21:51:13,612 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4822 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_4822 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_4822 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_4822 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) is different from false [2023-11-21 21:51:13,637 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4822 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_4822 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_4822 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_4822 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2023-11-21 21:51:13,687 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4821 (Array Int Int)) (v_ArrVal_4822 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_4821) |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_4821 (Array Int Int)) (v_ArrVal_4822 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_4821) |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_4821 (Array Int Int)) (v_ArrVal_4822 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_4821) |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_4821 (Array Int Int)) (v_ArrVal_4822 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_4821) |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2023-11-21 21:51:13,895 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (and (forall ((v_ArrVal_4821 (Array Int Int)) (v_ArrVal_4822 (Array Int Int)) (v_ArrVal_4812 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_4812) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_4821) |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_4821 (Array Int Int)) (v_ArrVal_4822 (Array Int Int)) (v_ArrVal_4812 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_4812) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_4821) |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_4821 (Array Int Int)) (v_ArrVal_4822 (Array Int Int)) (v_ArrVal_4812 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_4812) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_4821) |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_4821 (Array Int Int)) (v_ArrVal_4822 (Array Int Int)) (v_ArrVal_4812 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_4812) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_4821) |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))))) is different from false [2023-11-21 21:51:13,960 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (and (forall ((v_ArrVal_4821 (Array Int Int)) (v_ArrVal_4822 (Array Int Int)) (v_ArrVal_4812 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_4812) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_4821) |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_4821 (Array Int Int)) (v_ArrVal_4822 (Array Int Int)) (v_ArrVal_4812 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_4812) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_4821) |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0))) (forall ((v_ArrVal_4821 (Array Int Int)) (v_ArrVal_4822 (Array Int Int)) (v_ArrVal_4812 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_4812) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_4821) |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_4821 (Array Int Int)) (v_ArrVal_4822 (Array Int Int)) (v_ArrVal_4812 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_4812) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_4821) |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))))) is different from false [2023-11-21 21:51:13,986 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (and (forall ((v_ArrVal_4821 (Array Int Int)) (v_ArrVal_4822 (Array Int Int)) (v_ArrVal_4812 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_4812) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_4821) |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_4821 (Array Int Int)) (v_ArrVal_4822 (Array Int Int)) (v_ArrVal_4812 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_4812) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_4821) |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0))) (forall ((v_ArrVal_4821 (Array Int Int)) (v_ArrVal_4822 (Array Int Int)) (v_ArrVal_4812 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_4812) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_4821) |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_4821 (Array Int Int)) (v_ArrVal_4822 (Array Int Int)) (v_ArrVal_4812 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_4812) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_4821) |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2023-11-21 21:51:14,008 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (and (forall ((v_ArrVal_4821 (Array Int Int)) (v_ArrVal_4822 (Array Int Int)) (v_ArrVal_4812 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_4812) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_4821) |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_4821 (Array Int Int)) (v_ArrVal_4822 (Array Int Int)) (v_ArrVal_4812 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_4812) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_4821) |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_4821 (Array Int Int)) (v_ArrVal_4822 (Array Int Int)) (v_ArrVal_4812 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_4812) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_4821) |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_4821 (Array Int Int)) (v_ArrVal_4822 (Array Int Int)) (v_ArrVal_4812 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_4812) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_4821) |c_~#A~0.base| v_ArrVal_4822) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))))) is different from false [2023-11-21 21:51:14,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 24 [2023-11-21 21:51:14,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 42 treesize of output 34 [2023-11-21 21:51:14,802 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:51:14,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:51:14,810 INFO L378 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 53 [2023-11-21 21:51:14,812 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:51:14,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:51:14,816 INFO L378 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 64 treesize of output 26 [2023-11-21 21:51:14,821 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:51:14,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:51:14,828 INFO L378 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 47 treesize of output 57 [2023-11-21 21:51:14,830 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:51:14,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:51:14,833 INFO L378 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 68 treesize of output 28 [2023-11-21 21:51:14,838 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:51:14,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:51:14,860 INFO L378 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 47 treesize of output 57 [2023-11-21 21:51:14,863 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:51:14,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:51:14,870 INFO L378 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 52 treesize of output 24 [2023-11-21 21:51:20,068 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:51:20,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284184709] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:51:20,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:51:20,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 19] total 54 [2023-11-21 21:51:20,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444542809] [2023-11-21 21:51:20,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:51:20,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-21 21:51:20,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:51:20,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-21 21:51:20,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1941, Unknown=47, NotChecked=776, Total=2970 [2023-11-21 21:51:20,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:51:20,071 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:51:20,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 11.11111111111111) internal successors, (600), 55 states have internal predecessors, (600), 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-11-21 21:51:20,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:20,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:20,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:20,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:20,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:20,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:20,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:20,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:20,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:51:20,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-11-21 21:51:20,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:51:20,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:51:20,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-21 21:51:20,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:51:34,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:34,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:34,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:34,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:34,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:34,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:34,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:34,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:34,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:51:34,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 21:51:34,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:51:34,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:51:34,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-21 21:51:34,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:51:34,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-21 21:51:35,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:51:35,044 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:51:35,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:51:35,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1843793154, now seen corresponding path program 2 times [2023-11-21 21:51:35,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:51:35,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915315625] [2023-11-21 21:51:35,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:51:35,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:51:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:51:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:51:36,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:51:36,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915315625] [2023-11-21 21:51:36,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915315625] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:51:36,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788032465] [2023-11-21 21:51:36,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 21:51:36,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:51:36,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:51:36,753 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:51:36,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-21 21:51:38,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 21:51:38,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 21:51:38,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-21 21:51:38,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:51:38,593 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-21 21:51:38,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-21 21:51:38,741 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 21:51:38,742 INFO L378 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 14 treesize of output 13 [2023-11-21 21:51:38,830 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 21:51:38,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 25 [2023-11-21 21:51:40,019 INFO L378 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-11-21 21:51:40,068 INFO L378 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 19 treesize of output 18 [2023-11-21 21:51:40,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 21:51:40,582 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2023-11-21 21:51:40,582 INFO L378 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 26 [2023-11-21 21:51:40,976 INFO L378 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 30 treesize of output 21 [2023-11-21 21:51:40,999 INFO L378 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 33 treesize of output 38 [2023-11-21 21:51:41,077 INFO L378 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 37 treesize of output 26 [2023-11-21 21:51:41,103 INFO L378 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 37 treesize of output 26 [2023-11-21 21:51:41,130 INFO L378 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 37 treesize of output 26 [2023-11-21 21:51:41,247 INFO L378 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 37 treesize of output 26 [2023-11-21 21:51:41,277 INFO L378 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 37 treesize of output 26 [2023-11-21 21:51:41,307 INFO L378 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 37 treesize of output 26 [2023-11-21 21:51:41,334 INFO L378 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 37 treesize of output 26 [2023-11-21 21:51:41,767 INFO L378 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 37 treesize of output 26 [2023-11-21 21:51:41,790 INFO L378 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 37 treesize of output 26 [2023-11-21 21:51:41,817 INFO L378 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 37 treesize of output 26 [2023-11-21 21:51:41,839 INFO L378 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 40 treesize of output 48 [2023-11-21 21:51:42,046 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 21:51:42,046 INFO L378 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 65 treesize of output 55 [2023-11-21 21:51:42,133 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:51:42,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:51:42,147 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5330 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_5330) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_5330 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_5330) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_5330 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_5330) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_5330 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_5330) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of2ForFork0_#t~nondet49#1|))) is different from false [2023-11-21 21:51:42,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:51:42,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 102 treesize of output 102 [2023-11-21 21:51:42,371 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 |c_t_funThread2of2ForFork0_insert_~list#1.offset|)) (.cse1 (+ 1 |c_t_funThread2of2ForFork0_insert_~list#1.offset|)) (.cse2 (+ 2 |c_t_funThread2of2ForFork0_insert_~list#1.offset|))) (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (not (= (select v_arrayElimArr_12 .cse1) 0)) (forall ((v_ArrVal_5330 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_5330) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (not (= (select v_arrayElimArr_12 .cse2) 0)) (not (= (select v_arrayElimArr_12 |c_t_funThread2of2ForFork0_insert_~list#1.offset|) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)) (forall ((v_prenex_3 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_prenex_3) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (not (= (select v_arrayElimArr_12 |c_t_funThread2of2ForFork0_insert_~list#1.offset|) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (not (= (select v_arrayElimArr_12 .cse1) 0)) (forall ((v_prenex_1 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_prenex_1) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse2) 0)) (not (= (select v_arrayElimArr_12 |c_t_funThread2of2ForFork0_insert_~list#1.offset|) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (forall ((v_prenex_2 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_prenex_2) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)) (not (= (select v_arrayElimArr_12 |c_t_funThread2of2ForFork0_insert_~list#1.offset|) 0)))))) is different from false [2023-11-21 21:51:42,543 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_t_funThread2of2ForFork0_insert_#in~list#1.offset| 2)) (.cse1 (+ |c_t_funThread2of2ForFork0_insert_#in~list#1.offset| 3)) (.cse2 (+ |c_t_funThread2of2ForFork0_insert_#in~list#1.offset| 1))) (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (forall ((v_ArrVal_5330 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_5330) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)) (not (= (select v_arrayElimArr_12 |c_t_funThread2of2ForFork0_insert_#in~list#1.offset|) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (forall ((v_prenex_3 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_prenex_3) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)) (not (= (select v_arrayElimArr_12 |c_t_funThread2of2ForFork0_insert_#in~list#1.offset|) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)) (forall ((v_prenex_2 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_prenex_2) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_12 |c_t_funThread2of2ForFork0_insert_#in~list#1.offset|) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (forall ((v_prenex_1 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_prenex_1) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)) (not (= (select v_arrayElimArr_12 |c_t_funThread2of2ForFork0_insert_#in~list#1.offset|) 0)))))) is different from false [2023-11-21 21:51:42,602 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_t_funThread2of2ForFork0_insert_#in~list#1.offset| 2)) (.cse1 (+ |c_t_funThread2of2ForFork0_insert_#in~list#1.offset| 3)) (.cse2 (+ |c_t_funThread2of2ForFork0_insert_#in~list#1.offset| 1))) (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (forall ((v_prenex_1 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_insert_#in~p#1.base| v_prenex_1) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)) (not (= (select v_arrayElimArr_12 |c_t_funThread2of2ForFork0_insert_#in~list#1.offset|) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (forall ((v_prenex_3 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_insert_#in~p#1.base| v_prenex_3) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)) (not (= (select v_arrayElimArr_12 |c_t_funThread2of2ForFork0_insert_#in~list#1.offset|) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (forall ((v_ArrVal_5330 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_insert_#in~p#1.base| v_ArrVal_5330) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)) (not (= (select v_arrayElimArr_12 |c_t_funThread2of2ForFork0_insert_#in~list#1.offset|) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (forall ((v_prenex_2 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_insert_#in~p#1.base| v_prenex_2) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)) (not (= (select v_arrayElimArr_12 |c_t_funThread2of2ForFork0_insert_#in~list#1.offset|) 0)))))) is different from false [2023-11-21 21:51:42,681 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#A~0.offset| 2)) (.cse1 (+ |c_~#A~0.offset| 3)) (.cse2 (+ |c_~#A~0.offset| 1))) (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_ArrVal_5330 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_5330) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (not (= (select v_arrayElimArr_12 .cse0) 0)) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (forall ((v_prenex_3 (Array Int Int))) (= (select (select (store (store |c_#race| |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_~p~0#1.base| v_prenex_3) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (not (= (select v_arrayElimArr_12 .cse2) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (forall ((v_prenex_1 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_~p~0#1.base| v_prenex_1) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse2) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)) (forall ((v_prenex_2 (Array Int Int))) (= (select (select (store (store |c_#race| |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_~p~0#1.base| v_prenex_2) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)))))) is different from false [2023-11-21 21:51:43,047 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#A~0.offset| 2)) (.cse1 (+ |c_~#A~0.offset| 3)) (.cse2 (+ |c_~#A~0.offset| 1))) (and (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_5325 (Array Int Int))) (or (forall ((v_prenex_2 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_5325) |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_~p~0#1.base| v_prenex_2) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse0) 0)) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_5325 (Array Int Int))) (or (forall ((v_prenex_3 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_5325) |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_~p~0#1.base| v_prenex_3) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (not (= (select v_arrayElimArr_12 .cse0) 0)) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_5325 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (forall ((v_ArrVal_5330 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_5325) |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_5330) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_5325 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (forall ((v_prenex_1 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_5325) |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_~p~0#1.base| v_prenex_1) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)))))) is different from false [2023-11-21 21:51:43,953 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#A~0.offset| 2)) (.cse2 (+ |c_~#A~0.offset| 3)) (.cse0 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (.cse3 (+ |c_~#A~0.offset| 1))) (and (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_5325 (Array Int Int)) (v_ArrVal_5316 (Array Int Int))) (or (forall ((v_prenex_1 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_5316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_5325) |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_~p~0#1.base| v_prenex_1) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0))) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_12 .cse3) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_5325 (Array Int Int)) (v_ArrVal_5316 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (forall ((v_ArrVal_5330 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_5316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_5325) |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_5330) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (not (= (select v_arrayElimArr_12 .cse3) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_5325 (Array Int Int)) (v_ArrVal_5316 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (forall ((v_prenex_3 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_5316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_5325) |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_~p~0#1.base| v_prenex_3) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (not (= (select v_arrayElimArr_12 .cse3) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_5325 (Array Int Int)) (v_ArrVal_5316 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)) (forall ((v_prenex_2 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_5316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_5325) |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_~p~0#1.base| v_prenex_2) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_12 .cse3) 0)))))) is different from false [2023-11-21 21:51:44,127 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#A~0.offset| 2)) (.cse2 (+ |c_~#A~0.offset| 3)) (.cse0 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (.cse3 (+ |c_~#A~0.offset| 1))) (and (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_5325 (Array Int Int)) (v_ArrVal_5316 (Array Int Int))) (or (forall ((v_prenex_3 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_5316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_5325) |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_~p~0#1.base| v_prenex_3) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_12 .cse3) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_5325 (Array Int Int)) (v_ArrVal_5316 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)) (forall ((v_ArrVal_5330 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_5316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_5325) |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_5330) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_12 .cse3) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_5325 (Array Int Int)) (v_ArrVal_5316 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) 0)) (forall ((v_prenex_2 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_5316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_5325) |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_~p~0#1.base| v_prenex_2) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse2) 0)) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_12 .cse3) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_5325 (Array Int Int)) (v_ArrVal_5316 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)) (forall ((v_prenex_1 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_5316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_5325) |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_~p~0#1.base| v_prenex_1) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0))) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_12 .cse3) 0)))))) is different from false [2023-11-21 21:51:44,226 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#A~0.offset| 2)) (.cse1 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (.cse2 (+ |c_~#A~0.offset| 3)) (.cse3 (+ |c_~#A~0.offset| 1))) (and (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_5316 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (forall ((v_prenex_3 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_5316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_~p~0#1.base| v_prenex_3) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (not (= (select v_arrayElimArr_12 .cse2) 0)) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_12 .cse3) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_5316 (Array Int Int))) (or (forall ((v_prenex_2 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_5316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_~p~0#1.base| v_prenex_2) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse0) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_12 .cse3) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_5316 (Array Int Int))) (or (forall ((v_ArrVal_5330 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_5316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_5330) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (not (= (select v_arrayElimArr_12 .cse0) 0)) (not (= (select v_arrayElimArr_12 .cse2) 0)) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_12 .cse3) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_5316 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (forall ((v_prenex_1 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_5316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_~p~0#1.base| v_prenex_1) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1))) (not (= (select v_arrayElimArr_12 .cse2) 0)) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_12 .cse3) 0)))))) is different from false [2023-11-21 21:51:44,326 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#A~0.offset| 2)) (.cse1 (+ |c_~#A~0.offset| 3)) (.cse2 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (.cse3 (+ |c_~#A~0.offset| 1))) (and (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_5316 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (forall ((v_prenex_2 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_5316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse2 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_prenex_2) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse3) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_5316 (Array Int Int))) (or (forall ((v_ArrVal_5330 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_5316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse2 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_5330) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (not (= (select v_arrayElimArr_12 .cse0) 0)) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_12 .cse3) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_5316 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (not (= (select v_arrayElimArr_12 .cse1) 0)) (forall ((v_prenex_3 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_5316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse2 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_prenex_3) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_12 .cse3) 0)))) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_5316 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) 0)) (not (= (select v_arrayElimArr_12 .cse1) 0)) (not (= (select v_arrayElimArr_12 |c_~#A~0.offset|) 0)) (forall ((v_prenex_1 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_5316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse2 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_arrayElimArr_12) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_prenex_1) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse2))) (not (= (select v_arrayElimArr_12 .cse3) 0)))))) is different from false [2023-11-21 21:51:46,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:51:46,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 79 [2023-11-21 21:51:46,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 42 treesize of output 34 [2023-11-21 21:51:46,612 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:51:46,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:51:46,620 INFO L378 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 53 [2023-11-21 21:51:46,625 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:51:46,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:51:46,628 INFO L378 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 64 treesize of output 26 [2023-11-21 21:51:46,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:51:46,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 17 [2023-11-21 21:51:46,638 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:51:46,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:51:46,647 INFO L378 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 47 treesize of output 57 [2023-11-21 21:51:46,650 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:51:46,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:51:46,654 INFO L378 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 68 treesize of output 28 [2023-11-21 21:51:46,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:51:46,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 17 [2023-11-21 21:51:46,663 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:51:46,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:51:46,670 INFO L378 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 47 treesize of output 57 [2023-11-21 21:51:46,674 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:51:46,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:51:46,677 INFO L378 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 62 treesize of output 28 [2023-11-21 21:51:46,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:51:46,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 17 [2023-11-21 21:51:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:51:53,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788032465] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:51:53,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:51:53,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 65 [2023-11-21 21:51:53,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83995233] [2023-11-21 21:51:53,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:51:53,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-11-21 21:51:53,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:51:53,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-11-21 21:51:53,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2814, Unknown=44, NotChecked=1170, Total=4290 [2023-11-21 21:51:53,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:51:53,877 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:51:53,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 10.415384615384616) internal successors, (677), 66 states have internal predecessors, (677), 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-11-21 21:51:53,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:53,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:53,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:53,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:53,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:53,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:53,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:53,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:51:53,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:51:53,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-21 21:51:53,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:51:53,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:51:53,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-21 21:51:53,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:51:53,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:52:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:52:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 21:52:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:52:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:52:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-21 21:52:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:52:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-21 21:52:01,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-21 21:52:02,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-21 21:52:02,091 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:52:02,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:52:02,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1618622580, now seen corresponding path program 3 times [2023-11-21 21:52:02,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:52:02,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549000710] [2023-11-21 21:52:02,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:52:02,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:52:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:52:03,478 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:52:03,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:52:03,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549000710] [2023-11-21 21:52:03,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549000710] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:52:03,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898475539] [2023-11-21 21:52:03,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 21:52:03,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:52:03,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:52:03,480 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:52:03,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-21 21:52:05,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-21 21:52:05,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 21:52:05,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 90 conjunts are in the unsatisfiable core [2023-11-21 21:52:05,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:52:06,032 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-21 21:52:06,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-21 21:52:06,062 INFO L378 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 1 [2023-11-21 21:52:06,130 INFO L378 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 16 treesize of output 8 [2023-11-21 21:52:06,292 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-21 21:52:06,293 INFO L378 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 12 treesize of output 14 [2023-11-21 21:52:06,371 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 21:52:06,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-21 21:52:07,386 INFO L378 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-11-21 21:52:07,442 INFO L378 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 19 treesize of output 18 [2023-11-21 21:52:07,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 21:52:07,880 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-21 21:52:07,880 INFO L378 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 16 treesize of output 18 [2023-11-21 21:52:08,208 INFO L378 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 30 treesize of output 21 [2023-11-21 21:52:08,225 INFO L378 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 30 treesize of output 21 [2023-11-21 21:52:08,243 INFO L378 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 30 treesize of output 21 [2023-11-21 21:52:08,262 INFO L378 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 30 treesize of output 21 [2023-11-21 21:52:08,342 INFO L378 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 30 treesize of output 21 [2023-11-21 21:52:08,361 INFO L378 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 30 treesize of output 21 [2023-11-21 21:52:08,382 INFO L378 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 30 treesize of output 21 [2023-11-21 21:52:08,404 INFO L378 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 30 treesize of output 21 [2023-11-21 21:52:08,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 21:52:08,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2023-11-21 21:52:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:52:08,738 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 21:52:08,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898475539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:52:08,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 21:52:08,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [22] total 43 [2023-11-21 21:52:08,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925085604] [2023-11-21 21:52:08,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:52:08,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-21 21:52:08,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:52:08,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-21 21:52:08,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1695, Unknown=0, NotChecked=0, Total=1892 [2023-11-21 21:52:08,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:52:08,741 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:52:08,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 9.91304347826087) internal successors, (228), 24 states have internal predecessors, (228), 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-11-21 21:52:08,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:08,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:08,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:08,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:08,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:08,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:08,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:08,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:08,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:52:08,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-21 21:52:08,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:52:08,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:52:08,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-21 21:52:08,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:52:08,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-11-21 21:52:08,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:52:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:52:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 21:52:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:52:11,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:52:11,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-21 21:52:11,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:52:11,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-21 21:52:11,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-21 21:52:11,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-21 21:52:11,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:52:11,760 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:52:11,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:52:11,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2104028122, now seen corresponding path program 3 times [2023-11-21 21:52:11,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:52:11,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510034038] [2023-11-21 21:52:11,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:52:11,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:52:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:52:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:52:13,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:52:13,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510034038] [2023-11-21 21:52:13,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510034038] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:52:13,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607333793] [2023-11-21 21:52:13,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 21:52:13,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:52:13,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:52:13,363 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:52:13,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-21 21:52:17,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-21 21:52:17,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 21:52:17,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 89 conjunts are in the unsatisfiable core [2023-11-21 21:52:17,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:52:17,514 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-21 21:52:17,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-21 21:52:17,656 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 21:52:17,656 INFO L378 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 14 treesize of output 13 [2023-11-21 21:52:17,736 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 21:52:17,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 25 [2023-11-21 21:52:18,922 INFO L378 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-11-21 21:52:18,974 INFO L378 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 19 treesize of output 18 [2023-11-21 21:52:19,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 21:52:19,500 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2023-11-21 21:52:19,501 INFO L378 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 26 [2023-11-21 21:52:19,881 INFO L378 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 30 treesize of output 21 [2023-11-21 21:52:19,908 INFO L378 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 30 treesize of output 21 [2023-11-21 21:52:19,930 INFO L378 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 30 treesize of output 21 [2023-11-21 21:52:19,954 INFO L378 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 30 treesize of output 21 [2023-11-21 21:52:20,060 INFO L378 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 30 treesize of output 21 [2023-11-21 21:52:20,092 INFO L378 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 30 treesize of output 21 [2023-11-21 21:52:20,115 INFO L378 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 30 treesize of output 21 [2023-11-21 21:52:20,145 INFO L378 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 30 treesize of output 21 [2023-11-21 21:52:20,573 INFO L378 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 30 treesize of output 21 [2023-11-21 21:52:20,598 INFO L378 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 33 treesize of output 38 [2023-11-21 21:52:20,664 INFO L378 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 37 treesize of output 26 [2023-11-21 21:52:20,693 INFO L378 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 37 treesize of output 26 [2023-11-21 21:52:20,716 INFO L378 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 37 treesize of output 26 [2023-11-21 21:52:20,841 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 21:52:20,841 INFO L378 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 44 treesize of output 40 [2023-11-21 21:52:20,900 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:52:20,901 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:52:20,915 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_6316 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_6316 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) |c_t_funThread1of2ForFork0_#t~nondet49#1|))) is different from false [2023-11-21 21:52:21,002 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 1 |c_t_funThread2of2ForFork0_insert_~list#1.offset|))) (and (forall ((v_ArrVal_6315 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (not (= (select v_ArrVal_6315 .cse0) 0)))) (forall ((v_ArrVal_6315 (Array Int Int))) (or (not (= (select v_ArrVal_6315 .cse0) 0)) (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))))) (forall ((v_ArrVal_6315 (Array Int Int))) (or (not (= (select v_ArrVal_6315 .cse0) 0)) (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) (forall ((v_ArrVal_6315 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (not (= (select v_ArrVal_6315 .cse0) 0)))))) is different from false [2023-11-21 21:52:21,063 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (let ((.cse1 (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse2 |c_t_funThread1of2ForFork0_#t~nondet49#1|))) (.cse0 (+ 1 |c_t_funThread2of2ForFork0_insert_~list#1.offset|))) (and (forall ((v_ArrVal_6315 (Array Int Int))) (or (not (= (select v_ArrVal_6315 .cse0) 0)) (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store .cse1 |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse2))))) (forall ((v_ArrVal_6315 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store .cse1 |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (not (= (select v_ArrVal_6315 .cse0) 0)))) (forall ((v_ArrVal_6315 (Array Int Int))) (or (not (= (select v_ArrVal_6315 .cse0) 0)) (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store .cse1 |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) (forall ((v_ArrVal_6315 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store .cse1 |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (not (= (select v_ArrVal_6315 .cse0) 0))))))) is different from false [2023-11-21 21:52:21,089 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (.cse0 (+ 1 |c_t_funThread2of2ForFork0_insert_~list#1.offset|))) (and (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int))) (or (not (= (select v_ArrVal_6315 .cse0) 0)) (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int))) (or (not (= (select v_ArrVal_6315 .cse0) 0)) (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1))))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (not (= (select v_ArrVal_6315 .cse0) 0)))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (not (= (select v_ArrVal_6315 .cse0) 0)))))) is different from false [2023-11-21 21:52:21,133 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (.cse0 (+ |c_t_funThread2of2ForFork0_insert_#in~list#1.offset| 1))) (and (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int))) (or (not (= (select v_ArrVal_6315 .cse0) 0)) (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1))))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (not (= (select v_ArrVal_6315 .cse0) 0)))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int))) (or (not (= (select v_ArrVal_6315 .cse0) 0)) (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (not (= (select v_ArrVal_6315 .cse0) 0)))))) is different from false [2023-11-21 21:52:21,160 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (.cse1 (+ |c_t_funThread2of2ForFork0_insert_#in~list#1.offset| 1))) (and (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_insert_#in~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (not (= (select v_ArrVal_6315 .cse1) 0)))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_insert_#in~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (not (= (select v_ArrVal_6315 .cse1) 0)))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_insert_#in~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (not (= (select v_ArrVal_6315 .cse1) 0)))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_insert_#in~p#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0))) (not (= (select v_ArrVal_6315 .cse1) 0)))))) is different from false [2023-11-21 21:52:21,204 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (.cse1 (+ |c_~#A~0.offset| 1))) (and (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_~#A~0.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (not (= (select v_ArrVal_6315 .cse1) 0)))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_~#A~0.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (not (= (select v_ArrVal_6315 .cse1) 0)))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int))) (or (not (= (select v_ArrVal_6315 .cse1) 0)) (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_~#A~0.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0))))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_~#A~0.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (not (= (select v_ArrVal_6315 .cse1) 0)))))) is different from false [2023-11-21 21:52:21,329 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (.cse2 (+ |c_~#A~0.offset| 1))) (and (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (let ((.cse0 (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6309))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store .cse0 |c_~#A~0.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|))) |c_~#A~0.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (not (= (select v_ArrVal_6315 .cse2) 0)))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (let ((.cse3 (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6309))) (store .cse3 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store .cse3 |c_~#A~0.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|))) |c_~#A~0.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (not (= (select v_ArrVal_6315 .cse2) 0)))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6309))) (store .cse4 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store .cse4 |c_~#A~0.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|))) |c_~#A~0.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (not (= (select v_ArrVal_6315 .cse2) 0)))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (let ((.cse5 (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6309))) (store .cse5 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store .cse5 |c_~#A~0.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|))) |c_~#A~0.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (not (= (select v_ArrVal_6315 .cse2) 0)))))) is different from false [2023-11-21 21:52:21,622 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (.cse0 (+ |c_~#A~0.offset| 1))) (and (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (or (not (= (select v_ArrVal_6315 .cse0) 0)) (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (let ((.cse1 (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_6309))) (store .cse1 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store .cse1 |c_~#A~0.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse2 |c_t_funThread1of2ForFork0_#t~nondet49#1|))) |c_~#A~0.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (let ((.cse3 (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_6309))) (store .cse3 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store .cse3 |c_~#A~0.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse2 |c_t_funThread1of2ForFork0_#t~nondet49#1|))) |c_~#A~0.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (not (= (select v_ArrVal_6315 .cse0) 0)))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_6309))) (store .cse4 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store .cse4 |c_~#A~0.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse2 |c_t_funThread1of2ForFork0_#t~nondet49#1|))) |c_~#A~0.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse2) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (not (= (select v_ArrVal_6315 .cse0) 0)))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (let ((.cse5 (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_6309))) (store .cse5 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store .cse5 |c_~#A~0.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse2 |c_t_funThread1of2ForFork0_#t~nondet49#1|))) |c_~#A~0.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (not (= (select v_ArrVal_6315 .cse0) 0)))))) is different from false [2023-11-21 21:52:21,663 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#A~0.offset| 1)) (.cse0 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (and (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6309) |c_~#A~0.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (not (= (select v_ArrVal_6315 .cse1) 0)))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6309) |c_~#A~0.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0))) (not (= (select v_ArrVal_6315 .cse1) 0)))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6309) |c_~#A~0.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (not (= (select v_ArrVal_6315 .cse1) 0)))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (or (not (= (select v_ArrVal_6315 .cse1) 0)) (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6309) |c_~#A~0.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))))))) is different from false [2023-11-21 21:52:21,707 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (.cse1 (+ |c_~#A~0.offset| 1))) (and (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_6309) |c_~#A~0.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (not (= (select v_ArrVal_6315 .cse1) 0)))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_6309) |c_~#A~0.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (not (= (select v_ArrVal_6315 .cse1) 0)))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_6309) |c_~#A~0.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (not (= (select v_ArrVal_6315 .cse1) 0)))) (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6315 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (or (forall ((v_ArrVal_6316 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_6309) |c_~#A~0.base| v_ArrVal_6310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_ArrVal_6315) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_6316) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (not (= (select v_ArrVal_6315 .cse1) 0)))))) is different from false [2023-11-21 21:52:22,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:52:22,994 INFO L378 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 26 treesize of output 28 [2023-11-21 21:52:22,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 20 [2023-11-21 21:52:23,017 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:52:23,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:52:23,024 INFO L378 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 46 treesize of output 56 [2023-11-21 21:52:23,026 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:52:23,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:52:23,032 INFO L378 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 65 treesize of output 37 [2023-11-21 21:52:23,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2023-11-21 21:52:23,038 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:52:23,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:52:23,045 INFO L378 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 50 treesize of output 60 [2023-11-21 21:52:23,047 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:52:23,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:52:23,051 INFO L378 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 75 treesize of output 41 [2023-11-21 21:52:23,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2023-11-21 21:52:23,059 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:52:23,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:52:23,066 INFO L378 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 50 treesize of output 60 [2023-11-21 21:52:23,069 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:52:23,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:52:23,072 INFO L378 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 75 treesize of output 41 [2023-11-21 21:52:23,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2023-11-21 21:52:32,234 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:52:32,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607333793] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:52:32,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:52:32,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 22] total 61 [2023-11-21 21:52:32,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380826321] [2023-11-21 21:52:32,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:52:32,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-11-21 21:52:32,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:52:32,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-11-21 21:52:32,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2354, Unknown=14, NotChecked=1188, Total=3782 [2023-11-21 21:52:32,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:52:32,238 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:52:32,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 11.098360655737705) internal successors, (677), 62 states have internal predecessors, (677), 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-11-21 21:52:32,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:32,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:32,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:32,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:32,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:32,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:32,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:32,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:32,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:52:32,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-21 21:52:32,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:52:32,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:52:32,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-21 21:52:32,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:52:32,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-11-21 21:52:32,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-11-21 21:52:32,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:52:40,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:40,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:40,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:40,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:52:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 21:52:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:52:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:52:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-21 21:52:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:52:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-21 21:52:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-21 21:52:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-21 21:52:40,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-21 21:52:40,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:52:40,492 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:52:40,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:52:40,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1814906897, now seen corresponding path program 3 times [2023-11-21 21:52:40,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:52:40,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646610708] [2023-11-21 21:52:40,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:52:40,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:52:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:52:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:52:41,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:52:41,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646610708] [2023-11-21 21:52:41,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646610708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:52:41,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:52:41,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-21 21:52:41,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23752163] [2023-11-21 21:52:41,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:52:41,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-21 21:52:41,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:52:41,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-21 21:52:41,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-11-21 21:52:41,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:52:41,162 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:52:41,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 15.76923076923077) internal successors, (205), 14 states have internal predecessors, (205), 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-11-21 21:52:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:52:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-21 21:52:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:52:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:52:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-21 21:52:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:52:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-11-21 21:52:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-11-21 21:52:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-11-21 21:52:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:52:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:52:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:52:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 21:52:43,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:52:43,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:52:43,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-21 21:52:43,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:52:43,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-21 21:52:43,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-21 21:52:43,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-21 21:52:43,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 21:52:43,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-21 21:52:43,471 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:52:43,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:52:43,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2026057244, now seen corresponding path program 4 times [2023-11-21 21:52:43,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:52:43,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101089796] [2023-11-21 21:52:43,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:52:43,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:52:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:52:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:52:44,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:52:44,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101089796] [2023-11-21 21:52:44,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101089796] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:52:44,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636895514] [2023-11-21 21:52:44,890 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 21:52:44,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:52:44,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:52:44,891 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:52:44,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-21 21:52:54,158 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 21:52:54,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 21:52:54,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-21 21:52:54,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:52:54,226 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-21 21:52:54,226 INFO L378 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 12 treesize of output 14 [2023-11-21 21:52:54,321 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 21:52:54,321 INFO L378 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 14 treesize of output 13 [2023-11-21 21:52:54,383 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 21:52:54,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 25 [2023-11-21 21:52:55,095 INFO L378 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-11-21 21:52:55,141 INFO L378 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-11-21 21:52:55,441 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2023-11-21 21:52:55,441 INFO L378 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 26 [2023-11-21 21:52:55,682 INFO L378 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 25 treesize of output 18 [2023-11-21 21:52:55,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:52:55,697 INFO L378 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-11-21 21:52:55,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:52:55,752 INFO L378 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-11-21 21:52:55,806 INFO L378 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 43 treesize of output 32 [2023-11-21 21:52:55,827 INFO L378 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 43 treesize of output 32 [2023-11-21 21:52:55,844 INFO L378 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 43 treesize of output 32 [2023-11-21 21:52:55,922 INFO L378 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 43 treesize of output 32 [2023-11-21 21:52:55,939 INFO L378 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 43 treesize of output 32 [2023-11-21 21:52:55,958 INFO L378 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 43 treesize of output 32 [2023-11-21 21:52:55,974 INFO L378 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 43 treesize of output 32 [2023-11-21 21:52:56,180 INFO L378 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 43 treesize of output 32 [2023-11-21 21:52:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:52:56,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:52:56,339 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2023-11-21 21:52:56,747 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)))) (and (forall ((v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store .cse0 |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store .cse0 |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store .cse0 |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1))) (forall ((v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store .cse0 |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|)))))) is different from false [2023-11-21 21:52:56,758 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (.cse1 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (store (select |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse2 |c_t_funThread1of2ForFork0_#t~nondet49#1|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)))) (and (forall ((v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store .cse0 |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store .cse0 |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1))) (forall ((v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store .cse0 |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store .cse0 |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse2)))))) is different from false [2023-11-21 21:52:56,770 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (.cse1 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (and (forall ((v_ArrVal_6984 (Array Int Int)) (v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6984) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0))) (forall ((v_ArrVal_6984 (Array Int Int)) (v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6984) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_6984 (Array Int Int)) (v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6984) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_6984 (Array Int Int)) (v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6984) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1))))) is different from false [2023-11-21 21:52:56,806 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (.cse1 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (and (forall ((v_ArrVal_6984 (Array Int Int)) (v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_6984) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_6984 (Array Int Int)) (v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_6984) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_6984 (Array Int Int)) (v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_6984) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1))) (forall ((v_ArrVal_6984 (Array Int Int)) (v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_6984) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2023-11-21 21:52:56,826 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (.cse1 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (and (forall ((v_ArrVal_6984 (Array Int Int)) (v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (store (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6984) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0))) (forall ((v_ArrVal_6984 (Array Int Int)) (v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (store (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6984) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1))) (forall ((v_ArrVal_6984 (Array Int Int)) (v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (store (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6984) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_6984 (Array Int Int)) (v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (store (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6984) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)))) is different from false [2023-11-21 21:52:56,846 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (.cse0 (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (and (forall ((v_ArrVal_6984 (Array Int Int)) (v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (store (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_6984) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_6984 (Array Int Int)) (v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (store (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_6984) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1))) (forall ((v_ArrVal_6984 (Array Int Int)) (v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (store (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_6984) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_6984 (Array Int Int)) (v_ArrVal_6995 (Array Int Int)) (v_ArrVal_6996 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (store (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_6984) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_6995) |c_~#A~0.base| v_ArrVal_6996) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0) |c_t_funThread1of2ForFork0_#t~nondet49#1|)))) is different from false [2023-11-21 21:52:57,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:52:57,436 INFO L378 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 2 case distinctions, treesize of input 146 treesize of output 138 [2023-11-21 21:52:57,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:52:57,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 111 treesize of output 67 [2023-11-21 21:52:57,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 13 [2023-11-21 21:52:57,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 [2023-11-21 21:52:57,460 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:52:57,464 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:52:57,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:52:57,469 INFO L378 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 2 case distinctions, treesize of input 42 treesize of output 47 [2023-11-21 21:52:57,471 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:52:57,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:52:57,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 20 [2023-11-21 21:52:57,477 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:53:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:53:02,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636895514] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:53:02,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:53:02,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 19] total 54 [2023-11-21 21:53:02,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136088150] [2023-11-21 21:53:02,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:53:02,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-21 21:53:02,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:53:02,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-21 21:53:02,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2001, Unknown=85, NotChecked=686, Total=2970 [2023-11-21 21:53:02,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:53:02,529 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 21:53:02,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 11.11111111111111) internal successors, (600), 55 states have internal predecessors, (600), 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-11-21 21:53:02,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:53:02,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:53:02,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:53:02,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:53:02,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:53:02,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:53:02,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:53:02,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:53:02,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:53:02,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-21 21:53:02,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:53:02,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:53:02,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-21 21:53:02,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:53:02,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-11-21 21:53:02,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-11-21 21:53:02,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-11-21 21:53:02,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-21 21:53:02,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:53:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:53:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:53:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:53:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:53:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:53:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:53:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:53:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:53:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:53:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 21:53:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:53:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:53:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-21 21:53:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 21:53:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-21 21:53:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-21 21:53:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-21 21:53:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 21:53:07,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-21 21:53:07,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-21 21:53:07,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-11-21 21:53:07,773 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-21 21:53:07,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:53:07,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1257901698, now seen corresponding path program 4 times [2023-11-21 21:53:07,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:53:07,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811774857] [2023-11-21 21:53:07,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:53:07,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:53:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:53:09,319 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:53:09,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:53:09,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811774857] [2023-11-21 21:53:09,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811774857] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:53:09,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698012928] [2023-11-21 21:53:09,320 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 21:53:09,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:53:09,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 21:53:09,321 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:53:09,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process Killed by 15