./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_83-list2_racing1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 9a849f68 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 ../sv-benchmarks/c/goblint-regression/28-race_reach_83-list2_racing1.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 23c4aefdda14d4315577cd0030d174ab477745d4b270d2de822290a016a0ff8d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-9a849f6-m [2024-10-26 03:18:08,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-26 03:18:08,127 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-10-26 03:18:08,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-26 03:18:08,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-26 03:18:08,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-26 03:18:08,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-26 03:18:08,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-26 03:18:08,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-26 03:18:08,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-26 03:18:08,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-26 03:18:08,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-26 03:18:08,168 INFO L153 SettingsManager]: * Use SBE=true [2024-10-26 03:18:08,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-26 03:18:08,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-26 03:18:08,169 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-26 03:18:08,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-26 03:18:08,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-26 03:18:08,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-26 03:18:08,171 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-26 03:18:08,171 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-26 03:18:08,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-26 03:18:08,172 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-26 03:18:08,172 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-26 03:18:08,173 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-26 03:18:08,173 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-26 03:18:08,173 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-26 03:18:08,173 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-26 03:18:08,174 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-26 03:18:08,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-26 03:18:08,174 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-10-26 03:18:08,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-26 03:18:08,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 03:18:08,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-26 03:18:08,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-26 03:18:08,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-26 03:18:08,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-26 03:18:08,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-26 03:18:08,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-26 03:18:08,181 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-10-26 03:18:08,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-26 03:18:08,182 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-26 03:18:08,182 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-26 03:18:08,182 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 -> 23c4aefdda14d4315577cd0030d174ab477745d4b270d2de822290a016a0ff8d [2024-10-26 03:18:08,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-26 03:18:08,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-26 03:18:08,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-26 03:18:08,519 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-26 03:18:08,519 INFO L274 PluginConnector]: CDTParser initialized [2024-10-26 03:18:08,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_83-list2_racing1.i [2024-10-26 03:18:09,956 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-26 03:18:10,276 INFO L384 CDTParser]: Found 1 translation units. [2024-10-26 03:18:10,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_83-list2_racing1.i [2024-10-26 03:18:10,306 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/089eabe11/852a30b2ccda40109367143c20cd37f2/FLAG8b550899c [2024-10-26 03:18:10,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/089eabe11/852a30b2ccda40109367143c20cd37f2 [2024-10-26 03:18:10,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-26 03:18:10,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-26 03:18:10,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-26 03:18:10,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-26 03:18:10,577 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-26 03:18:10,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 03:18:10" (1/1) ... [2024-10-26 03:18:10,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75585e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:18:10, skipping insertion in model container [2024-10-26 03:18:10,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 03:18:10" (1/1) ... [2024-10-26 03:18:10,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-26 03:18:11,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 03:18:11,142 INFO L200 MainTranslator]: Completed pre-run [2024-10-26 03:18:11,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 03:18:11,266 INFO L204 MainTranslator]: Completed translation [2024-10-26 03:18:11,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:18:11 WrapperNode [2024-10-26 03:18:11,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-26 03:18:11,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-26 03:18:11,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-26 03:18:11,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-26 03:18:11,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:18:11" (1/1) ... [2024-10-26 03:18:11,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:18:11" (1/1) ... [2024-10-26 03:18:11,359 INFO L138 Inliner]: procedures = 280, calls = 97, calls flagged for inlining = 11, calls inlined = 12, statements flattened = 571 [2024-10-26 03:18:11,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-26 03:18:11,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-26 03:18:11,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-26 03:18:11,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-26 03:18:11,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:18:11" (1/1) ... [2024-10-26 03:18:11,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:18:11" (1/1) ... [2024-10-26 03:18:11,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:18:11" (1/1) ... [2024-10-26 03:18:11,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:18:11" (1/1) ... [2024-10-26 03:18:11,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:18:11" (1/1) ... [2024-10-26 03:18:11,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:18:11" (1/1) ... [2024-10-26 03:18:11,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:18:11" (1/1) ... [2024-10-26 03:18:11,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:18:11" (1/1) ... [2024-10-26 03:18:11,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-26 03:18:11,454 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-26 03:18:11,454 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-26 03:18:11,454 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-26 03:18:11,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:18:11" (1/1) ... [2024-10-26 03:18:11,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 03:18:11,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:18:11,496 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) [2024-10-26 03:18:11,499 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 [2024-10-26 03:18:11,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-26 03:18:11,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-10-26 03:18:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2024-10-26 03:18:11,592 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2024-10-26 03:18:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-26 03:18:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-26 03:18:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-26 03:18:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2024-10-26 03:18:11,592 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2024-10-26 03:18:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-26 03:18:11,593 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-26 03:18:11,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-26 03:18:11,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-26 03:18:11,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-26 03:18:11,594 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2024-10-26 03:18:11,594 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2024-10-26 03:18:11,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-26 03:18:11,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-26 03:18:11,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-26 03:18:11,597 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-26 03:18:11,800 INFO L238 CfgBuilder]: Building ICFG [2024-10-26 03:18:11,802 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-26 03:18:12,612 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-26 03:18:12,612 INFO L287 CfgBuilder]: Performing block encoding [2024-10-26 03:18:12,674 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-26 03:18:12,675 INFO L314 CfgBuilder]: Removed 28 assume(true) statements. [2024-10-26 03:18:12,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:18:12 BoogieIcfgContainer [2024-10-26 03:18:12,679 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-26 03:18:12,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-26 03:18:12,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-26 03:18:12,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-26 03:18:12,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 03:18:10" (1/3) ... [2024-10-26 03:18:12,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9ac3a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 03:18:12, skipping insertion in model container [2024-10-26 03:18:12,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:18:11" (2/3) ... [2024-10-26 03:18:12,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9ac3a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 03:18:12, skipping insertion in model container [2024-10-26 03:18:12,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:18:12" (3/3) ... [2024-10-26 03:18:12,688 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_83-list2_racing1.i [2024-10-26 03:18:12,706 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-26 03:18:12,706 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-10-26 03:18:12,706 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-26 03:18:12,887 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2024-10-26 03:18:12,947 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:18:12,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 03:18:12,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:18:12,951 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) [2024-10-26 03:18:12,953 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 [2024-10-26 03:18:12,998 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 03:18:13,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t3_funThread1of1ForFork0 ======== [2024-10-26 03:18:13,019 INFO L333 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, 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;@7d9a706f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:18:13,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-26 03:18:39,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t3_funErr0ASSERT_VIOLATIONDATA_RACE === [t3_funErr0ASSERT_VIOLATIONDATA_RACE, t3_funErr1ASSERT_VIOLATIONDATA_RACE, t3_funErr2ASSERT_VIOLATIONDATA_RACE, t3_funErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-26 03:18:39,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:18:39,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1338532225, now seen corresponding path program 1 times [2024-10-26 03:18:39,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:18:39,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634915593] [2024-10-26 03:18:39,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:18:39,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:18:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:18:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-26 03:18:40,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:18:40,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634915593] [2024-10-26 03:18:40,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634915593] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:18:40,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989147215] [2024-10-26 03:18:40,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:18:40,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:18:40,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:18:40,313 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) [2024-10-26 03:18:40,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-26 03:18:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:18:40,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-26 03:18:40,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:18:40,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-26 03:18:40,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 03:18:40,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989147215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:18:40,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-26 03:18:40,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-26 03:18:40,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252641984] [2024-10-26 03:18:40,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:18:40,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 03:18:40,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:18:40,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 03:18:40,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:18:40,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:18:40,608 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:18:40,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 75.0) internal successors, (150), 3 states have internal predecessors, (150), 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) [2024-10-26 03:18:40,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:18:45,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:18:45,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-26 03:18:45,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-26 03:18:45,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t3_funErr1ASSERT_VIOLATIONDATA_RACE === [t3_funErr0ASSERT_VIOLATIONDATA_RACE, t3_funErr1ASSERT_VIOLATIONDATA_RACE, t3_funErr2ASSERT_VIOLATIONDATA_RACE, t3_funErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-26 03:18:45,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:18:45,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1109040601, now seen corresponding path program 1 times [2024-10-26 03:18:45,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:18:45,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718939525] [2024-10-26 03:18:45,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:18:45,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:18:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:18:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-26 03:18:45,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:18:45,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718939525] [2024-10-26 03:18:45,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718939525] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:18:45,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503785511] [2024-10-26 03:18:45,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:18:45,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:18:45,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:18:45,958 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:18:45,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-26 03:18:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:18:46,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-26 03:18:46,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:18:46,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-26 03:18:46,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:18:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-26 03:18:46,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503785511] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:18:46,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:18:46,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-26 03:18:46,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871354290] [2024-10-26 03:18:46,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:18:46,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-26 03:18:46,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:18:46,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-26 03:18:46,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-26 03:18:46,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:18:46,264 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:18:46,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 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) [2024-10-26 03:18:46,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:18:46,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:18:48,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:18:48,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:18:48,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2024-10-26 03:18:48,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2024-10-26 03:18:48,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2024-10-26 03:18:48,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr7ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2024-10-26 03:18:48,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2024-10-26 03:18:48,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr5ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2024-10-26 03:18:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2024-10-26 03:18:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr6ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2024-10-26 03:18:48,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-26 03:18:48,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:18:48,452 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-26 03:18:48,455 INFO L312 ceAbstractionStarter]: Result for error location t3_funThread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/4) [2024-10-26 03:18:48,465 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:18:48,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 03:18:48,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:18:48,469 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) [2024-10-26 03:18:48,470 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 [2024-10-26 03:18:48,473 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 03:18:48,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2_funThread1of1ForFork1 ======== [2024-10-26 03:18:48,474 INFO L333 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, 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;@7d9a706f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:18:48,474 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-26 03:18:52,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-26 03:18:52,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:18:52,023 INFO L85 PathProgramCache]: Analyzing trace with hash -825745241, now seen corresponding path program 1 times [2024-10-26 03:18:52,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:18:52,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890292086] [2024-10-26 03:18:52,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:18:52,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:18:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:18:52,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:18:52,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:18:52,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890292086] [2024-10-26 03:18:52,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890292086] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:18:52,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432186823] [2024-10-26 03:18:52,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:18:52,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:18:52,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:18:52,242 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) [2024-10-26 03:18:52,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-26 03:18:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:18:52,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-26 03:18:52,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:18:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-26 03:18:52,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 03:18:52,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432186823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:18:52,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-26 03:18:52,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-26 03:18:52,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424522751] [2024-10-26 03:18:52,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:18:52,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 03:18:52,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:18:52,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 03:18:52,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:18:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:18:52,448 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:18:52,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 66.0) internal successors, (132), 3 states have internal predecessors, (132), 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) [2024-10-26 03:18:52,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:18:52,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:18:52,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-26 03:18:52,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:18:52,986 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2_funErr1ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-26 03:18:52,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:18:52,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1351692437, now seen corresponding path program 1 times [2024-10-26 03:18:52,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:18:52,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286247689] [2024-10-26 03:18:52,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:18:52,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:18:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:18:53,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:18:53,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:18:53,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286247689] [2024-10-26 03:18:53,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286247689] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:18:53,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905227290] [2024-10-26 03:18:53,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:18:53,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:18:53,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:18:53,175 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) [2024-10-26 03:18:53,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-26 03:18:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:18:53,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-26 03:18:53,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:18:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:18:53,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:18:53,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:18:53,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905227290] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:18:53,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:18:53,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-26 03:18:53,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665193118] [2024-10-26 03:18:53,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:18:53,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-26 03:18:53,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:18:53,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-26 03:18:53,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-26 03:18:53,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:18:53,478 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:18:53,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.5) internal successors, (175), 10 states have internal predecessors, (175), 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) [2024-10-26 03:18:53,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:18:53,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:18:55,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:18:55,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:18:55,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2024-10-26 03:18:55,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2024-10-26 03:18:55,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2024-10-26 03:18:55,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr7ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2024-10-26 03:18:55,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2024-10-26 03:18:55,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr5ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2024-10-26 03:18:55,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2024-10-26 03:18:55,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr6ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2024-10-26 03:18:55,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-26 03:18:55,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:18:55,655 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-26 03:18:55,655 INFO L312 ceAbstractionStarter]: Result for error location t2_funThread1of1ForFork1 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (2/4) [2024-10-26 03:18:55,662 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:18:55,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 03:18:55,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:18:55,665 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-26 03:18:55,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2024-10-26 03:18:55,669 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 03:18:55,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1_funThread1of1ForFork2 ======== [2024-10-26 03:18:55,670 INFO L333 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, 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;@7d9a706f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:18:55,670 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-26 03:18:56,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1_funErr0ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:18:56,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:18:56,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2099967564, now seen corresponding path program 1 times [2024-10-26 03:18:56,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:18:56,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59337397] [2024-10-26 03:18:56,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:18:56,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:18:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:18:56,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:18:56,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:18:56,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59337397] [2024-10-26 03:18:56,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59337397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:18:56,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:18:56,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:18:56,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273383917] [2024-10-26 03:18:56,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:18:56,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:18:56,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:18:56,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:18:56,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:18:56,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:18:56,814 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:18:56,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.0) internal successors, (125), 6 states have internal predecessors, (125), 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) [2024-10-26 03:18:56,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:18:57,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:18:57,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-26 03:18:57,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1_funErr1ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:18:57,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:18:57,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1118677817, now seen corresponding path program 1 times [2024-10-26 03:18:57,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:18:57,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063081136] [2024-10-26 03:18:57,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:18:57,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:18:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:18:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:18:58,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:18:58,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063081136] [2024-10-26 03:18:58,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063081136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:18:58,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:18:58,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:18:58,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206294959] [2024-10-26 03:18:58,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:18:58,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:18:58,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:18:58,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:18:58,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:18:58,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:18:58,004 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:18:58,005 INFO L472 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) [2024-10-26 03:18:58,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:18:58,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:18:58,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:18:58,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:18:58,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-26 03:18:58,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1_funErr2ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:18:58,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:18:58,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1321487455, now seen corresponding path program 1 times [2024-10-26 03:18:58,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:18:58,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460268776] [2024-10-26 03:18:58,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:18:58,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:18:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:18:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:18:58,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:18:58,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460268776] [2024-10-26 03:18:58,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460268776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:18:58,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:18:58,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 03:18:58,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657227770] [2024-10-26 03:18:58,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:18:58,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 03:18:58,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:18:58,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 03:18:58,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 03:18:58,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:18:58,442 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:18:58,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 70.5) internal successors, (141), 3 states have internal predecessors, (141), 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) [2024-10-26 03:18:58,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:18:58,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:18:58,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:18:59,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:18:59,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:18:59,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:18:59,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-26 03:18:59,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1_funErr4ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:18:59,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:18:59,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1723616631, now seen corresponding path program 1 times [2024-10-26 03:18:59,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:18:59,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165231210] [2024-10-26 03:18:59,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:18:59,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:18:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:18:59,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:18:59,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:18:59,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165231210] [2024-10-26 03:18:59,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165231210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:18:59,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:18:59,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:18:59,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699423094] [2024-10-26 03:18:59,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:18:59,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:18:59,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:18:59,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:18:59,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:18:59,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:18:59,874 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:18:59,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.4) internal successors, (157), 6 states have internal predecessors, (157), 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) [2024-10-26 03:18:59,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:18:59,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:18:59,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:18:59,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:00,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:00,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:00,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:00,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:00,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-26 03:19:00,896 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:19:00,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:00,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1139595809, now seen corresponding path program 1 times [2024-10-26 03:19:00,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:00,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351247950] [2024-10-26 03:19:00,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:00,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:01,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:01,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351247950] [2024-10-26 03:19:01,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351247950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:19:01,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:19:01,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:19:01,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715061450] [2024-10-26 03:19:01,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:19:01,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:19:01,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:01,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:19:01,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:19:01,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:01,642 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:01,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.2) internal successors, (166), 6 states have internal predecessors, (166), 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) [2024-10-26 03:19:01,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:01,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:01,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:01,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:01,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:02,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:02,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:02,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:02,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:02,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:02,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-26 03:19:02,133 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:19:02,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:02,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1196743324, now seen corresponding path program 1 times [2024-10-26 03:19:02,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:02,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750992721] [2024-10-26 03:19:02,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:02,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:02,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:02,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:02,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750992721] [2024-10-26 03:19:02,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750992721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:19:02,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:19:02,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:19:02,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997115712] [2024-10-26 03:19:02,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:19:02,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:19:02,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:02,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:19:02,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:19:02,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:02,671 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:02,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 34.8) internal successors, (174), 6 states have internal predecessors, (174), 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) [2024-10-26 03:19:02,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:02,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:02,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:02,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:02,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:02,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:03,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:03,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:03,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:03,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:03,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:03,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:03,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-26 03:19:03,207 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:19:03,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:03,207 INFO L85 PathProgramCache]: Analyzing trace with hash -2049562454, now seen corresponding path program 1 times [2024-10-26 03:19:03,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:03,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441370424] [2024-10-26 03:19:03,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:03,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:04,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:04,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:04,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441370424] [2024-10-26 03:19:04,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441370424] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:19:04,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179576536] [2024-10-26 03:19:04,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:04,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:19:04,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:19:04,140 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) [2024-10-26 03:19:04,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-26 03:19:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:04,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-26 03:19:04,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:19:04,524 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-26 03:19:04,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 03:19:04,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:04,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 03:19:04,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:04,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 03:19:04,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:19:04,716 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 45 treesize of output 34 [2024-10-26 03:19:04,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:04,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:19:04,753 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1844 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_insert_#t~nondet14#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1844) |c_t1_funThread1of1ForFork2_insert_~node#1.base|) (+ 7 |c_t1_funThread1of1ForFork2_insert_~node#1.offset|)))) (forall ((v_ArrVal_1844 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1844) |c_t1_funThread1of1ForFork2_insert_~node#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~node#1.offset| 4)) |c_t1_funThread1of1ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_1844 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_insert_#t~nondet14#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1844) |c_t1_funThread1of1ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of1ForFork2_insert_~node#1.offset|)))) (forall ((v_ArrVal_1844 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_insert_#t~nondet14#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1844) |c_t1_funThread1of1ForFork2_insert_~node#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~node#1.offset| 6))))) is different from false [2024-10-26 03:19:04,843 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_t1_funThread1of1ForFork2_insert_~node#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_insert_~node#1.base| (store (select |c_#race| |c_t1_funThread1of1ForFork2_insert_~node#1.base|) .cse1 |c_t1_funThread1of1ForFork2_insert_#t~nondet14#1|)))) (and (forall ((v_ArrVal_1844 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_insert_#t~nondet14#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1844) |c_t1_funThread1of1ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of1ForFork2_insert_~node#1.offset|)))) (forall ((v_ArrVal_1844 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1844) |c_t1_funThread1of1ForFork2_insert_~node#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~node#1.offset| 4)) |c_t1_funThread1of1ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_1844 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1844) |c_t1_funThread1of1ForFork2_insert_~node#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~node#1.offset| 6)) |c_t1_funThread1of1ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_1844 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1844) |c_t1_funThread1of1ForFork2_insert_~node#1.base|) .cse1) |c_t1_funThread1of1ForFork2_insert_#t~nondet14#1|))))) is different from false [2024-10-26 03:19:08,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:08,749 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 37 treesize of output 53 [2024-10-26 03:19:08,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:08,757 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 86 treesize of output 32 [2024-10-26 03:19:08,770 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:19:08,771 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:19:08,780 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:19:08,781 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:19:08,787 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:19:08,787 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:19:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:19:08,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179576536] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:19:08,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:19:08,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-10-26 03:19:08,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14819277] [2024-10-26 03:19:08,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:19:08,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-26 03:19:08,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:08,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-26 03:19:08,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=568, Unknown=26, NotChecked=102, Total=812 [2024-10-26 03:19:08,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:08,945 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:08,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 11.785714285714286) internal successors, (330), 29 states have internal predecessors, (330), 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) [2024-10-26 03:19:08,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:08,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:08,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:08,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:08,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:08,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:08,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:10,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:10,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:10,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:10,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:10,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:10,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:10,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:19:10,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-26 03:19:10,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:19:10,696 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:19:10,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:10,696 INFO L85 PathProgramCache]: Analyzing trace with hash -540532025, now seen corresponding path program 1 times [2024-10-26 03:19:10,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:10,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392799006] [2024-10-26 03:19:10,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:10,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:10,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:10,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392799006] [2024-10-26 03:19:10,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392799006] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:19:10,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219068649] [2024-10-26 03:19:10,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:10,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:19:10,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:19:10,853 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) [2024-10-26 03:19:10,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-26 03:19:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:11,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-26 03:19:11,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:19:11,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:11,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:19:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:11,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219068649] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:19:11,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:19:11,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-26 03:19:11,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092022288] [2024-10-26 03:19:11,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:19:11,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-26 03:19:11,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:11,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-26 03:19:11,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-26 03:19:11,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:11,268 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:11,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 34.1) internal successors, (341), 10 states have internal predecessors, (341), 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) [2024-10-26 03:19:11,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:11,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:11,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:11,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:11,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:11,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:11,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:19:11,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:12,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:12,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:12,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:12,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:12,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:12,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:12,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:19:12,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:12,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-26 03:19:12,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:19:12,588 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:19:12,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:12,589 INFO L85 PathProgramCache]: Analyzing trace with hash -850625379, now seen corresponding path program 1 times [2024-10-26 03:19:12,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:12,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287479604] [2024-10-26 03:19:12,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:12,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:13,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:13,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:13,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287479604] [2024-10-26 03:19:13,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287479604] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:19:13,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989611237] [2024-10-26 03:19:13,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:13,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:19:13,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:19:13,612 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) [2024-10-26 03:19:13,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-26 03:19:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:13,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-26 03:19:13,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:19:14,120 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-26 03:19:14,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 03:19:14,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:14,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 03:19:14,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:14,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 03:19:14,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:19:14,311 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 45 treesize of output 34 [2024-10-26 03:19:14,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:14,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:19:14,340 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2434 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_2434 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_2434 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7)))) (forall ((v_ArrVal_2434 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|))) is different from false [2024-10-26 03:19:14,413 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_2434 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_2434 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)))) (forall ((v_ArrVal_2434 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_2434 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|))))) is different from false [2024-10-26 03:19:14,424 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) (.cse2 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base| (store (store (select |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_2434 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_2434 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_2434 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_2434 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|))))) is different from false [2024-10-26 03:19:16,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:16,323 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 37 treesize of output 53 [2024-10-26 03:19:16,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:16,327 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 86 treesize of output 32 [2024-10-26 03:19:16,333 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:19:16,334 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:19:16,339 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:19:16,339 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:19:16,346 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:19:16,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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:19:16,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:19:16,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989611237] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:19:16,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:19:16,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2024-10-26 03:19:16,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513259022] [2024-10-26 03:19:16,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:19:16,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-26 03:19:16,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:16,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-26 03:19:16,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=745, Unknown=15, NotChecked=174, Total=1056 [2024-10-26 03:19:16,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:16,587 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:16,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 11.71875) internal successors, (375), 33 states have internal predecessors, (375), 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) [2024-10-26 03:19:16,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:16,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:16,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:16,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:16,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:16,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:16,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:19:16,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:16,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:18,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:18,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:18,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:18,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:18,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:18,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:18,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:19:18,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:18,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:19:18,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-26 03:19:18,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-26 03:19:18,412 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1_funErr4ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:19:18,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:18,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1281557921, now seen corresponding path program 1 times [2024-10-26 03:19:18,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:18,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811487907] [2024-10-26 03:19:18,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:18,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:19,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:19,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:19,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811487907] [2024-10-26 03:19:19,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811487907] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:19:19,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621735779] [2024-10-26 03:19:19,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:19,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:19:19,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:19:19,411 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) [2024-10-26 03:19:19,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-26 03:19:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:19,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-26 03:19:19,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:19:19,842 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-26 03:19:19,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 03:19:19,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:19,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 03:19:19,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:19,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 03:19:20,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:19:20,019 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 45 treesize of output 34 [2024-10-26 03:19:20,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:20,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:19:21,931 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_2688 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2688) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) 0)) (forall ((v_ArrVal_2688 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2688) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4)) 0)) (forall ((v_ArrVal_2688 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2688) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)) 0)) (forall ((v_ArrVal_2688 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2688) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1) 0))))) is different from false [2024-10-26 03:19:25,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:25,692 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 37 treesize of output 53 [2024-10-26 03:19:25,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:25,695 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 66 treesize of output 36 [2024-10-26 03:19:25,701 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:19:25,702 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:19:25,705 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:19:25,705 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:19:25,708 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:19:25,708 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:19:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:25,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621735779] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:19:25,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:19:25,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2024-10-26 03:19:25,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713548660] [2024-10-26 03:19:25,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:19:25,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-26 03:19:25,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:25,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-26 03:19:25,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=807, Unknown=59, NotChecked=60, Total=1056 [2024-10-26 03:19:25,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:25,915 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:25,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 11.15625) internal successors, (357), 33 states have internal predecessors, (357), 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) [2024-10-26 03:19:25,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:25,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:25,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:25,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:25,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:25,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:25,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:19:25,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:25,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:19:25,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:19:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:19:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:19:27,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-26 03:19:27,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:19:27,472 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1_funErr3ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:19:27,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:27,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1321488449, now seen corresponding path program 1 times [2024-10-26 03:19:27,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:27,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476112874] [2024-10-26 03:19:27,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:27,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:27,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:27,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:27,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476112874] [2024-10-26 03:19:27,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476112874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:19:27,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:19:27,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 03:19:27,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51291733] [2024-10-26 03:19:27,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:19:27,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 03:19:27,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:27,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 03:19:27,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 03:19:27,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:27,534 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:27,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 70.5) internal successors, (141), 3 states have internal predecessors, (141), 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) [2024-10-26 03:19:27,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:27,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:27,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:27,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:27,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:27,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:27,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:19:27,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:27,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:19:27,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:19:27,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:27,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:19:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:27,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-26 03:19:27,724 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:19:27,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:27,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1610927134, now seen corresponding path program 1 times [2024-10-26 03:19:27,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:27,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809201648] [2024-10-26 03:19:27,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:27,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:28,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:28,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809201648] [2024-10-26 03:19:28,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809201648] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:19:28,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899562505] [2024-10-26 03:19:28,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:28,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:19:28,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:19:28,776 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) [2024-10-26 03:19:28,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-26 03:19:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:29,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-26 03:19:29,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:19:29,246 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-26 03:19:29,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 03:19:29,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:29,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 03:19:29,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:29,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 03:19:29,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:19:29,452 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 45 treesize of output 34 [2024-10-26 03:19:29,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:29,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:19:29,479 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|))) is different from false [2024-10-26 03:19:29,560 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_3076 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1))) (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_3076 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)))) (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|))))) is different from false [2024-10-26 03:19:29,575 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) (.cse1 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base| (store (store (select |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_3076 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4))))))) is different from false [2024-10-26 03:19:29,588 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)) (.cse2 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) (.cse1 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse3 |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse3) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|))))) is different from false [2024-10-26 03:19:29,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:29,601 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 37 treesize of output 53 [2024-10-26 03:19:29,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:29,608 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 86 treesize of output 32 [2024-10-26 03:19:29,615 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:19:29,615 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:19:29,621 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:19:29,621 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:19:29,627 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:19:29,627 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:19:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:19:29,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899562505] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:19:29,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:19:29,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2024-10-26 03:19:29,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229612252] [2024-10-26 03:19:29,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:19:29,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-26 03:19:29,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:29,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-26 03:19:29,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=824, Unknown=4, NotChecked=244, Total=1190 [2024-10-26 03:19:29,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:29,823 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:29,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 11.029411764705882) internal successors, (375), 35 states have internal predecessors, (375), 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) [2024-10-26 03:19:29,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:29,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:29,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:29,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:29,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:29,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:29,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:19:29,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:29,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:29,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:29,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:29,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:30,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:30,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:30,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:30,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:30,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:30,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:30,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:19:30,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:30,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:30,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:30,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:30,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:30,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-26 03:19:31,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-26 03:19:31,084 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1_funErr4ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:19:31,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:31,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1705117118, now seen corresponding path program 1 times [2024-10-26 03:19:31,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:31,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025221850] [2024-10-26 03:19:31,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:31,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:31,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:31,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:31,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025221850] [2024-10-26 03:19:31,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025221850] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:19:31,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077369426] [2024-10-26 03:19:31,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:31,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:19:31,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:19:31,839 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) [2024-10-26 03:19:31,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-26 03:19:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:32,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-26 03:19:32,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:19:32,263 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-26 03:19:32,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 03:19:32,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:32,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 03:19:32,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:32,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 03:19:32,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:19:32,441 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 45 treesize of output 34 [2024-10-26 03:19:32,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:32,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:19:32,461 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4)) 0)) (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) 0)) (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7)) 0)) (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)) 0))) is different from false [2024-10-26 03:19:32,532 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)) 0)) (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) 0)) (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1) 0)) (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4)) 0))))) is different from false [2024-10-26 03:19:32,546 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) (.cse1 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base| (store (store (select |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1) 0)) (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4)) 0)) (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse2) 0)) (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)) 0))))) is different from false [2024-10-26 03:19:32,563 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)) (.cse3 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) (.cse1 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1) 0)) (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse2) 0)) (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse3) 0)) (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4)) 0))))) is different from false [2024-10-26 03:19:32,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:32,577 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 37 treesize of output 53 [2024-10-26 03:19:32,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:32,582 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 66 treesize of output 36 [2024-10-26 03:19:32,589 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:19:32,589 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:19:32,593 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:19:32,593 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:19:32,596 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:19:32,596 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:19:32,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:19:32,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077369426] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:19:32,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:19:32,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2024-10-26 03:19:32,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87415564] [2024-10-26 03:19:32,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:19:32,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-26 03:19:32,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:32,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-26 03:19:32,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=824, Unknown=4, NotChecked=244, Total=1190 [2024-10-26 03:19:32,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:32,767 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:32,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 10.5) internal successors, (357), 35 states have internal predecessors, (357), 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) [2024-10-26 03:19:32,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:32,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:32,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:32,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:32,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:32,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:32,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:19:32,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:32,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:32,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:32,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:32,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:32,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:33,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:33,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:33,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:33,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:33,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:33,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:33,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:19:33,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:33,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:33,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:33,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:33,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:33,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:33,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-26 03:19:33,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-26 03:19:33,959 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1_funErr1ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:19:33,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:33,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1028422225, now seen corresponding path program 1 times [2024-10-26 03:19:33,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:33,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947833965] [2024-10-26 03:19:33,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:33,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:34,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:34,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:34,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947833965] [2024-10-26 03:19:34,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947833965] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:19:34,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002479740] [2024-10-26 03:19:34,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:34,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:19:34,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:19:34,560 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:19:34,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-26 03:19:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:34,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-26 03:19:34,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:19:34,896 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-26 03:19:34,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 03:19:34,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:34,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 03:19:34,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:34,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 03:19:35,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:19:35,064 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 45 treesize of output 34 [2024-10-26 03:19:35,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:35,070 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:19:35,084 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 7 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 4 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 6 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 5 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|))) is different from false [2024-10-26 03:19:35,159 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_t1_funThread1of1ForFork2_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_init_~p#1.base| (store (select |c_#race| |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse1 |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)))) (and (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse1) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 6 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 5 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 4 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|))))) is different from false [2024-10-26 03:19:35,174 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of1ForFork2_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_init_~p#1.base| (store (store (select |c_#race| |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse1 |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|) .cse2 |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)))) (and (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 4 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse1) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse2) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 5 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|))))) is different from false [2024-10-26 03:19:35,191 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 5 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) (.cse3 (+ 6 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of1ForFork2_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_init_~p#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse1 |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|) .cse3 |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|) .cse2 |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)))) (and (forall ((v_ArrVal_3565 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_init_#t~nondet4#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse1))) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse2) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 4 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse3) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|))))) is different from false [2024-10-26 03:19:35,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:35,207 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 37 treesize of output 53 [2024-10-26 03:19:35,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:35,212 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 86 treesize of output 32 [2024-10-26 03:19:35,219 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:19:35,219 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:19:35,223 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:19:35,224 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:19:35,231 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:19:35,231 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:19:35,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:19:35,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002479740] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:19:35,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:19:35,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-10-26 03:19:35,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895438046] [2024-10-26 03:19:35,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:19:35,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-26 03:19:35,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:35,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-26 03:19:35,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=510, Unknown=4, NotChecked=196, Total=812 [2024-10-26 03:19:35,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:35,315 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:35,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 7.785714285714286) internal successors, (218), 29 states have internal predecessors, (218), 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) [2024-10-26 03:19:35,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:35,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:35,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:35,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:35,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:35,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:35,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:19:35,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:35,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:35,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:35,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:35,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:35,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:35,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:37,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:37,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:37,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:19:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:37,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:19:37,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-26 03:19:37,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-26 03:19:37,375 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1_funErr0ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:19:37,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:37,376 INFO L85 PathProgramCache]: Analyzing trace with hash 644689988, now seen corresponding path program 1 times [2024-10-26 03:19:37,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:37,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147460479] [2024-10-26 03:19:37,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:37,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:37,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:37,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147460479] [2024-10-26 03:19:37,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147460479] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:19:37,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204385425] [2024-10-26 03:19:37,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:37,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:19:37,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:19:37,885 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:19:37,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-26 03:19:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:38,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-26 03:19:38,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:19:38,305 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 03:19:38,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-26 03:19:38,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:38,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-26 03:19:38,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:38,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-26 03:19:38,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:19:38,474 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 [2024-10-26 03:19:38,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:38,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:19:38,494 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3773 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 2 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) |c_t1_funThread1of1ForFork2_init_#t~nondet3#1|)) (forall ((v_ArrVal_3773 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ |c_t1_funThread1of1ForFork2_init_~p#1.offset| 1)) |c_t1_funThread1of1ForFork2_init_#t~nondet3#1|)) (forall ((v_ArrVal_3773 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) |c_t1_funThread1of1ForFork2_init_~p#1.offset|) |c_t1_funThread1of1ForFork2_init_#t~nondet3#1|)) (forall ((v_ArrVal_3773 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 3 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) |c_t1_funThread1of1ForFork2_init_#t~nondet3#1|))) is different from false [2024-10-26 03:19:38,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_t1_funThread1of1ForFork2_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_init_~p#1.base| (store (select |c_#race| |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse1 |c_t1_funThread1of1ForFork2_init_#t~nondet3#1|)))) (and (forall ((v_ArrVal_3773 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_init_#t~nondet3#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse1))) (forall ((v_ArrVal_3773 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_init_#t~nondet3#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 2 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)))) (forall ((v_ArrVal_3773 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_init_#t~nondet3#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) |c_t1_funThread1of1ForFork2_init_~p#1.offset|))) (forall ((v_ArrVal_3773 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ |c_t1_funThread1of1ForFork2_init_~p#1.offset| 1)) |c_t1_funThread1of1ForFork2_init_#t~nondet3#1|))))) is different from false [2024-10-26 03:19:38,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) (.cse2 (+ 3 |c_t1_funThread1of1ForFork2_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_init_~p#1.base| (store (store (select |c_#race| |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse1 |c_t1_funThread1of1ForFork2_init_#t~nondet3#1|) .cse2 |c_t1_funThread1of1ForFork2_init_#t~nondet3#1|)))) (and (forall ((v_ArrVal_3773 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_init_#t~nondet3#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse1))) (forall ((v_ArrVal_3773 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ |c_t1_funThread1of1ForFork2_init_~p#1.offset| 1)) |c_t1_funThread1of1ForFork2_init_#t~nondet3#1|)) (forall ((v_ArrVal_3773 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) |c_t1_funThread1of1ForFork2_init_~p#1.offset|) |c_t1_funThread1of1ForFork2_init_#t~nondet3#1|)) (forall ((v_ArrVal_3773 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_init_#t~nondet3#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse2)))))) is different from false [2024-10-26 03:19:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:19:40,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204385425] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:19:40,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:19:40,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2024-10-26 03:19:40,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348101931] [2024-10-26 03:19:40,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:19:40,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-26 03:19:40,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:40,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-26 03:19:40,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=509, Unknown=3, NotChecked=144, Total=756 [2024-10-26 03:19:40,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:40,530 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:40,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 7.444444444444445) internal successors, (201), 28 states have internal predecessors, (201), 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) [2024-10-26 03:19:40,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:40,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:40,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:40,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:40,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:40,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:40,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:19:40,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:40,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:40,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:40,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:40,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:40,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:40,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:19:40,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:41,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:41,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:41,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:41,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:41,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:41,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:41,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:19:41,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:41,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:41,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:41,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:41,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:41,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:19:41,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:19:41,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:19:41,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2024-10-26 03:19:41,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-10-26 03:19:41,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr2ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-10-26 03:19:41,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-10-26 03:19:41,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-10-26 03:19:41,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr5ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-10-26 03:19:41,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr6ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-10-26 03:19:41,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-26 03:19:41,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:19:42,008 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-26 03:19:42,009 INFO L312 ceAbstractionStarter]: Result for error location t1_funThread1of1ForFork2 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (3/4) [2024-10-26 03:19:42,014 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:19:42,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 03:19:42,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:19:42,016 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-26 03:19:42,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (17)] Waiting until timeout for monitored process [2024-10-26 03:19:42,023 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 03:19:42,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-26 03:19:42,024 INFO L333 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, 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;@7d9a706f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:19:42,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-10-26 03:19:42,039 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-10-26 03:19:42,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:42,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1267596029, now seen corresponding path program 1 times [2024-10-26 03:19:42,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:42,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079272963] [2024-10-26 03:19:42,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:42,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:42,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:42,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:42,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079272963] [2024-10-26 03:19:42,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079272963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:19:42,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:19:42,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 03:19:42,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848838309] [2024-10-26 03:19:42,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:19:42,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 03:19:42,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:42,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 03:19:42,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 03:19:42,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:42,055 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:42,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 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) [2024-10-26 03:19:42,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:42,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-26 03:19:42,061 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-10-26 03:19:42,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:42,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1942460582, now seen corresponding path program 1 times [2024-10-26 03:19:42,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:42,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338971622] [2024-10-26 03:19:42,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:42,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:42,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:42,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338971622] [2024-10-26 03:19:42,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338971622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:19:42,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:19:42,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 03:19:42,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868400434] [2024-10-26 03:19:42,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:19:42,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 03:19:42,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:42,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 03:19:42,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 03:19:42,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:42,076 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:42,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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) [2024-10-26 03:19:42,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:42,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-26 03:19:42,084 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-10-26 03:19:42,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:42,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2042168887, now seen corresponding path program 1 times [2024-10-26 03:19:42,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:42,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879200640] [2024-10-26 03:19:42,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:42,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:42,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:42,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:42,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879200640] [2024-10-26 03:19:42,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879200640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:19:42,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:19:42,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:19:42,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559826938] [2024-10-26 03:19:42,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:19:42,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:19:42,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:42,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:19:42,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:19:42,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:42,195 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:42,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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) [2024-10-26 03:19:42,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:42,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:42,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-26 03:19:42,217 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-10-26 03:19:42,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:42,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1766123996, now seen corresponding path program 1 times [2024-10-26 03:19:42,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:42,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261416014] [2024-10-26 03:19:42,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:42,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:42,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:42,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261416014] [2024-10-26 03:19:42,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261416014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:19:42,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:19:42,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:19:42,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323918444] [2024-10-26 03:19:42,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:19:42,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:19:42,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:42,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:19:42,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:19:42,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:42,374 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:42,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 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) [2024-10-26 03:19:42,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:42,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:42,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:42,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:42,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-26 03:19:42,411 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-10-26 03:19:42,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:42,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2101971401, now seen corresponding path program 1 times [2024-10-26 03:19:42,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:42,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203847824] [2024-10-26 03:19:42,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:42,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:42,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:42,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203847824] [2024-10-26 03:19:42,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203847824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:19:42,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:19:42,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 03:19:42,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095500865] [2024-10-26 03:19:42,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:19:42,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 03:19:42,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:42,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 03:19:42,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 03:19:42,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:42,437 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:42,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 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) [2024-10-26 03:19:42,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:42,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:42,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:42,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:42,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:42,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-26 03:19:42,444 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-10-26 03:19:42,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:42,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1143590106, now seen corresponding path program 1 times [2024-10-26 03:19:42,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:42,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809788106] [2024-10-26 03:19:42,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:42,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:42,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:42,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809788106] [2024-10-26 03:19:42,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809788106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:19:42,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:19:42,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 03:19:42,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050118370] [2024-10-26 03:19:42,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:19:42,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 03:19:42,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:42,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 03:19:42,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 03:19:42,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:42,468 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:42,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 38.5) internal successors, (77), 3 states have internal predecessors, (77), 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) [2024-10-26 03:19:42,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:42,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:42,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:42,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:42,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:42,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-26 03:19:42,542 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-10-26 03:19:42,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:42,543 INFO L85 PathProgramCache]: Analyzing trace with hash -741827082, now seen corresponding path program 1 times [2024-10-26 03:19:42,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:42,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154374010] [2024-10-26 03:19:42,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:42,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:42,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:42,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154374010] [2024-10-26 03:19:42,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154374010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:19:42,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:19:42,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:19:42,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301625215] [2024-10-26 03:19:42,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:19:42,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:19:42,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:42,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:19:42,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:19:42,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:42,754 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:42,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.0) internal successors, (110), 6 states have internal predecessors, (110), 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) [2024-10-26 03:19:42,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:42,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:42,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:42,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:43,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:43,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:43,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:43,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:43,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:43,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:43,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:43,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-26 03:19:43,234 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-10-26 03:19:43,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:43,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1500983658, now seen corresponding path program 1 times [2024-10-26 03:19:43,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:43,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25361977] [2024-10-26 03:19:43,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:43,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 03:19:43,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-26 03:19:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 03:19:43,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-26 03:19:43,319 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-26 03:19:43,319 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2024-10-26 03:19:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2024-10-26 03:19:43,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2024-10-26 03:19:43,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2024-10-26 03:19:43,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2024-10-26 03:19:43,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2024-10-26 03:19:43,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2024-10-26 03:19:43,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2024-10-26 03:19:43,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2024-10-26 03:19:43,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2024-10-26 03:19:43,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2024-10-26 03:19:43,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining) [2024-10-26 03:19:43,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2024-10-26 03:19:43,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2024-10-26 03:19:43,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2024-10-26 03:19:43,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 17 remaining) [2024-10-26 03:19:43,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 17 remaining) [2024-10-26 03:19:43,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-26 03:19:43,325 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-26 03:19:43,325 INFO L312 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 (4/4) [2024-10-26 03:19:43,326 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-26 03:19:43,326 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-26 03:19:43,423 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-10-26 03:19:43,434 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:19:43,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 03:19:43,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:19:43,436 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-26 03:19:43,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Waiting until timeout for monitored process [2024-10-26 03:19:43,444 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 03:19:43,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1_funThread1of2ForFork2 ======== [2024-10-26 03:19:43,444 INFO L333 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, 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;@7d9a706f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:19:43,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-26 03:19:43,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1_funErr0ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:19:43,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:43,952 INFO L85 PathProgramCache]: Analyzing trace with hash -911417492, now seen corresponding path program 1 times [2024-10-26 03:19:43,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:43,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003842007] [2024-10-26 03:19:43,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:43,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:44,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:44,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003842007] [2024-10-26 03:19:44,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003842007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:19:44,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:19:44,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:19:44,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424440471] [2024-10-26 03:19:44,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:19:44,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:19:44,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:44,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:19:44,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:19:44,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:44,173 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:44,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.0) internal successors, (125), 6 states have internal predecessors, (125), 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) [2024-10-26 03:19:44,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:44,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:44,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-26 03:19:44,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1_funErr1ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:19:44,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:44,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1748732785, now seen corresponding path program 1 times [2024-10-26 03:19:44,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:44,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869690995] [2024-10-26 03:19:44,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:44,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:44,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:44,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869690995] [2024-10-26 03:19:44,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869690995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:19:44,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:19:44,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:19:44,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978967607] [2024-10-26 03:19:44,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:19:44,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:19:44,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:44,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:19:44,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:19:44,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:44,981 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:44,981 INFO L472 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) [2024-10-26 03:19:44,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:44,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:45,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:45,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:45,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-26 03:19:45,438 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1_funErr2ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:19:45,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:45,439 INFO L85 PathProgramCache]: Analyzing trace with hash 194361111, now seen corresponding path program 1 times [2024-10-26 03:19:45,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:45,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046236627] [2024-10-26 03:19:45,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:45,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:45,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:45,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:45,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046236627] [2024-10-26 03:19:45,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046236627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:19:45,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:19:45,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 03:19:45,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496085485] [2024-10-26 03:19:45,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:19:45,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 03:19:45,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:45,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 03:19:45,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 03:19:45,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:45,484 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:45,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 70.5) internal successors, (141), 3 states have internal predecessors, (141), 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) [2024-10-26 03:19:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:46,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:46,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:46,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:46,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-26 03:19:46,429 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1_funErr4ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:19:46,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:46,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1740328383, now seen corresponding path program 1 times [2024-10-26 03:19:46,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:46,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191877713] [2024-10-26 03:19:46,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:46,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:46,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:46,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191877713] [2024-10-26 03:19:46,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191877713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:19:46,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:19:46,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:19:46,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564899730] [2024-10-26 03:19:46,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:19:46,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:19:46,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:46,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:19:46,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:19:46,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:46,697 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:46,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.4) internal successors, (157), 6 states have internal predecessors, (157), 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) [2024-10-26 03:19:46,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:46,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:46,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:46,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:47,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:47,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:47,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:47,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:47,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-26 03:19:47,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:19:47,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:47,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1161334516, now seen corresponding path program 1 times [2024-10-26 03:19:47,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:47,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144513241] [2024-10-26 03:19:47,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:47,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:48,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:48,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:48,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144513241] [2024-10-26 03:19:48,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144513241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:19:48,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:19:48,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:19:48,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52564348] [2024-10-26 03:19:48,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:19:48,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:19:48,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:48,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:19:48,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:19:48,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:48,298 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:48,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.2) internal successors, (166), 6 states have internal predecessors, (166), 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) [2024-10-26 03:19:48,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:48,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:48,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:48,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:48,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:48,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:48,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:48,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:48,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:48,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:48,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-26 03:19:48,953 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:19:48,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:48,953 INFO L85 PathProgramCache]: Analyzing trace with hash 68630033, now seen corresponding path program 1 times [2024-10-26 03:19:48,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:48,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670889866] [2024-10-26 03:19:48,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:48,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:49,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:49,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670889866] [2024-10-26 03:19:49,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670889866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:19:49,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:19:49,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:19:49,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735119772] [2024-10-26 03:19:49,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:19:49,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:19:49,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:49,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:19:49,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:19:49,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:49,291 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:49,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 34.8) internal successors, (174), 6 states have internal predecessors, (174), 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) [2024-10-26 03:19:49,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:49,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:49,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:49,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:49,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:49,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:54,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:54,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:54,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:54,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:54,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:54,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:54,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-26 03:19:54,774 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:19:54,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:19:54,774 INFO L85 PathProgramCache]: Analyzing trace with hash 760114858, now seen corresponding path program 1 times [2024-10-26 03:19:54,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:19:54,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467472340] [2024-10-26 03:19:54,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:54,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:19:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:55,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:55,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:19:55,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467472340] [2024-10-26 03:19:55,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467472340] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:19:55,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505455255] [2024-10-26 03:19:55,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:19:55,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:19:55,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:19:55,350 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:19:55,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-26 03:19:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:19:55,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-26 03:19:55,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:19:55,824 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-26 03:19:55,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 03:19:55,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:55,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 03:19:55,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:55,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 03:19:55,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:19:55,991 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 45 treesize of output 34 [2024-10-26 03:19:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:19:55,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:19:56,012 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))) is different from false [2024-10-26 03:19:56,085 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base| (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)))) (and (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))))) is different from false [2024-10-26 03:19:56,100 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base| (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)))) (and (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))))) is different from false [2024-10-26 03:19:56,116 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) (.cse2 (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) (.cse1 (+ 7 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)))) (and (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse3) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))))) is different from false [2024-10-26 03:19:56,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:56,132 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 37 treesize of output 53 [2024-10-26 03:19:56,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:19:56,138 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 86 treesize of output 32 [2024-10-26 03:19:56,144 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:19:56,144 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:19:56,148 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:19:56,148 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:19:56,152 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:19:56,153 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:19:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:19:56,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505455255] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:19:56,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:19:56,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-10-26 03:19:56,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928648754] [2024-10-26 03:19:56,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:19:56,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-26 03:19:56,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:19:56,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-26 03:19:56,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=510, Unknown=4, NotChecked=196, Total=812 [2024-10-26 03:19:56,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:19:56,303 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:19:56,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 11.785714285714286) internal successors, (330), 29 states have internal predecessors, (330), 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) [2024-10-26 03:19:56,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:56,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:56,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:19:56,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:56,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:56,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:19:56,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:20:00,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:00,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:00,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:20:00,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:00,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:00,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:00,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:20:00,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-26 03:20:00,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-10-26 03:20:00,960 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:20:00,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:20:00,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1420393192, now seen corresponding path program 1 times [2024-10-26 03:20:00,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:20:00,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816646043] [2024-10-26 03:20:00,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:20:00,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:20:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:20:01,341 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-26 03:20:01,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:20:01,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816646043] [2024-10-26 03:20:01,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816646043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:20:01,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:20:01,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-26 03:20:01,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363117919] [2024-10-26 03:20:01,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:20:01,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:20:01,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:20:01,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:20:01,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:20:01,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:20:01,344 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:20:01,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 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) [2024-10-26 03:20:01,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:01,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:01,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:20:01,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:01,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:01,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:01,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:20:01,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:20:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:20:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:20:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:05,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-26 03:20:05,033 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:20:05,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:20:05,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1889596358, now seen corresponding path program 1 times [2024-10-26 03:20:05,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:20:05,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869560070] [2024-10-26 03:20:05,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:20:05,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:20:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:20:06,208 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:20:06,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:20:06,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869560070] [2024-10-26 03:20:06,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869560070] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:20:06,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608211226] [2024-10-26 03:20:06,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:20:06,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:20:06,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:20:06,210 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:20:06,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-26 03:20:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:20:06,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-26 03:20:06,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:20:06,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-26 03:20:07,034 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-26 03:20:07,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 03:20:07,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:07,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 03:20:07,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:07,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 03:20:07,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:07,255 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 45 treesize of output 34 [2024-10-26 03:20:07,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:07,269 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 45 treesize of output 34 [2024-10-26 03:20:07,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:07,284 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 45 treesize of output 34 [2024-10-26 03:20:07,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:07,297 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 45 treesize of output 34 [2024-10-26 03:20:07,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:07,406 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 45 treesize of output 34 [2024-10-26 03:20:07,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:07,424 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 45 treesize of output 34 [2024-10-26 03:20:07,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:07,438 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 45 treesize of output 34 [2024-10-26 03:20:07,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:07,452 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 45 treesize of output 34 [2024-10-26 03:20:07,516 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:20:07,517 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 11 treesize of output 11 [2024-10-26 03:20:07,573 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 45 treesize of output 34 [2024-10-26 03:20:07,579 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:20:07,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:20:07,592 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5622 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1| (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)))) (forall ((v_ArrVal_5622 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5622 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5622 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1| (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|))))) is different from false [2024-10-26 03:20:07,610 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5622 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5622 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5622 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5622 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))) is different from false [2024-10-26 03:20:07,705 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5622 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5622 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5622 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5622 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))) is different from false [2024-10-26 03:20:19,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:19,982 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 40 treesize of output 56 [2024-10-26 03:20:19,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:19,986 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 226 treesize of output 130 [2024-10-26 03:20:19,991 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 17 treesize of output 13 [2024-10-26 03:20:19,994 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 [2024-10-26 03:20:20,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:20,016 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 40 treesize of output 56 [2024-10-26 03:20:20,018 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:20:20,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:20,020 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 70 treesize of output 28 [2024-10-26 03:20:20,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:20,035 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 40 treesize of output 56 [2024-10-26 03:20:20,039 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:20:20,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:20,043 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 86 treesize of output 32 [2024-10-26 03:20:20,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:20,058 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 40 treesize of output 56 [2024-10-26 03:20:20,061 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:20:20,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:20,065 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 86 treesize of output 32 [2024-10-26 03:20:26,494 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 10 treesize of output 8 [2024-10-26 03:20:26,544 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:20:26,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608211226] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:20:26,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:20:26,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 40 [2024-10-26 03:20:26,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694569344] [2024-10-26 03:20:26,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:20:26,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-26 03:20:26,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:20:26,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-26 03:20:26,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1209, Unknown=38, NotChecked=222, Total=1640 [2024-10-26 03:20:26,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:20:26,548 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:20:26,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 9.9) internal successors, (396), 41 states have internal predecessors, (396), 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) [2024-10-26 03:20:26,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:26,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:26,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:20:26,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:26,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:26,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:26,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:20:26,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:26,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:20:31,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:31,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:31,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:20:31,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:31,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:31,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:31,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:20:31,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:31,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:20:31,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-10-26 03:20:31,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:20:31,488 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:20:31,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:20:31,488 INFO L85 PathProgramCache]: Analyzing trace with hash -433801851, now seen corresponding path program 1 times [2024-10-26 03:20:31,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:20:31,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767726401] [2024-10-26 03:20:31,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:20:31,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:20:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:20:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-26 03:20:31,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:20:31,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767726401] [2024-10-26 03:20:31,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767726401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:20:31,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:20:31,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-26 03:20:31,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902101186] [2024-10-26 03:20:31,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:20:31,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 03:20:31,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:20:31,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 03:20:31,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 03:20:31,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:20:31,717 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:20:31,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 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) [2024-10-26 03:20:31,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:31,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:31,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:20:31,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:31,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:31,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:31,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:20:31,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:31,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:20:31,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:20:32,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:32,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:32,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:20:32,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:32,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:32,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:32,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:20:32,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:32,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:20:32,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:20:32,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-26 03:20:32,808 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:20:32,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:20:32,808 INFO L85 PathProgramCache]: Analyzing trace with hash -837681183, now seen corresponding path program 1 times [2024-10-26 03:20:32,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:20:32,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224992997] [2024-10-26 03:20:32,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:20:32,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:20:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:20:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:20:32,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:20:32,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224992997] [2024-10-26 03:20:32,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224992997] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:20:32,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687861343] [2024-10-26 03:20:32,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:20:32,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:20:32,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:20:32,946 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:20:32,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-26 03:20:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:20:33,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-26 03:20:33,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:20:33,469 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:20:33,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:20:33,600 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:20:33,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687861343] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:20:33,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:20:33,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-10-26 03:20:33,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170076953] [2024-10-26 03:20:33,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:20:33,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-26 03:20:33,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:20:33,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-26 03:20:33,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-26 03:20:33,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:20:33,602 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:20:33,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 26.357142857142858) internal successors, (369), 14 states have internal predecessors, (369), 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) [2024-10-26 03:20:33,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:33,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:33,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:20:33,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:33,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:33,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:33,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:20:33,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:33,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:20:33,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:20:33,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:20:34,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:34,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:20:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:20:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:20:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:20:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:20:34,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-10-26 03:20:34,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-10-26 03:20:34,548 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:20:34,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:20:34,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2046595208, now seen corresponding path program 2 times [2024-10-26 03:20:34,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:20:34,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883378182] [2024-10-26 03:20:34,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:20:34,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:20:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:20:35,478 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:20:35,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:20:35,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883378182] [2024-10-26 03:20:35,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883378182] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:20:35,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161564489] [2024-10-26 03:20:35,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 03:20:35,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:20:35,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:20:35,480 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:20:35,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-26 03:20:36,315 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 03:20:36,316 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:20:36,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-26 03:20:36,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:20:36,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-26 03:20:36,561 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-26 03:20:36,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 03:20:36,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:36,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 03:20:36,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:36,729 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 36 treesize of output 27 [2024-10-26 03:20:36,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:36,739 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 36 treesize of output 27 [2024-10-26 03:20:36,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:36,758 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 36 treesize of output 27 [2024-10-26 03:20:36,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:36,776 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 36 treesize of output 27 [2024-10-26 03:20:36,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:36,896 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 36 treesize of output 27 [2024-10-26 03:20:36,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:36,914 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 36 treesize of output 27 [2024-10-26 03:20:36,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:36,930 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 36 treesize of output 27 [2024-10-26 03:20:36,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:36,949 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 36 treesize of output 27 [2024-10-26 03:20:36,991 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:20:36,991 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 11 treesize of output 11 [2024-10-26 03:20:37,057 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 36 treesize of output 27 [2024-10-26 03:20:37,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:37,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 03:20:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:20:37,076 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:20:37,100 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6543 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_6543) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_6543 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_6543) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_6543 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_6543) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))) is different from false [2024-10-26 03:20:37,122 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6543 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_6543) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_6543 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_6543) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_6543 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_6543) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))) is different from false [2024-10-26 03:20:37,134 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6543 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_6543) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_6543 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_6543) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_6543 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_6543) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))) is different from false [2024-10-26 03:20:37,145 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6543 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_6543) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_6543 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_6543) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_6543 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1| (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_6543) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|))))) is different from false [2024-10-26 03:20:41,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:41,880 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 35 treesize of output 46 [2024-10-26 03:20:41,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:41,887 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 116 treesize of output 62 [2024-10-26 03:20:41,890 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 [2024-10-26 03:20:41,892 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 [2024-10-26 03:20:41,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:41,911 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 35 treesize of output 46 [2024-10-26 03:20:41,913 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:20:41,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:41,915 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 54 treesize of output 24 [2024-10-26 03:20:41,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:41,924 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 35 treesize of output 46 [2024-10-26 03:20:41,925 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:20:41,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:41,928 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 70 treesize of output 28 [2024-10-26 03:20:46,271 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 10 treesize of output 8 [2024-10-26 03:20:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:20:46,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161564489] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:20:46,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:20:46,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 37 [2024-10-26 03:20:46,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351932297] [2024-10-26 03:20:46,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:20:46,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-26 03:20:46,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:20:46,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-26 03:20:46,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=985, Unknown=15, NotChecked=268, Total=1406 [2024-10-26 03:20:46,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:20:46,323 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:20:46,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 10.567567567567568) internal successors, (391), 38 states have internal predecessors, (391), 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) [2024-10-26 03:20:46,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:46,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:46,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:20:46,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:46,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:46,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:46,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:20:46,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:46,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:20:46,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:20:46,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:20:46,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:20:49,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:49,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:49,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:20:49,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:49,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:49,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:49,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:20:49,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:49,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:20:49,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:20:49,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:20:49,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:20:49,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-10-26 03:20:49,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-10-26 03:20:49,829 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:20:49,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:20:49,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1873788218, now seen corresponding path program 3 times [2024-10-26 03:20:49,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:20:49,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136882671] [2024-10-26 03:20:49,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:20:49,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:20:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:20:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:20:50,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:20:50,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136882671] [2024-10-26 03:20:50,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136882671] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:20:50,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848380393] [2024-10-26 03:20:50,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 03:20:50,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:20:50,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:20:50,859 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:20:50,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-26 03:20:53,157 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-26 03:20:53,158 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:20:53,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-10-26 03:20:53,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:20:53,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-26 03:20:53,642 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 03:20:53,687 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 19 treesize of output 18 [2024-10-26 03:20:53,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:53,896 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 23 treesize of output 16 [2024-10-26 03:20:53,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:53,913 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 23 treesize of output 16 [2024-10-26 03:20:53,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:53,925 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 23 treesize of output 16 [2024-10-26 03:20:53,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:53,938 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 23 treesize of output 16 [2024-10-26 03:20:54,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:54,045 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 23 treesize of output 16 [2024-10-26 03:20:54,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:54,062 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 23 treesize of output 16 [2024-10-26 03:20:54,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:54,076 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 23 treesize of output 16 [2024-10-26 03:20:54,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:20:54,092 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 23 treesize of output 16 [2024-10-26 03:20:54,159 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:20:54,159 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 11 treesize of output 11 [2024-10-26 03:20:54,353 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 23 treesize of output 16 [2024-10-26 03:20:54,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:54,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-10-26 03:20:54,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:54,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-10-26 03:20:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-26 03:20:54,495 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:20:54,518 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6923 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_6923) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_6923 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_6923) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))) is different from false [2024-10-26 03:20:54,588 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6923 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_6923) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_6923 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_6923) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))) is different from false [2024-10-26 03:20:54,596 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6923 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_6923) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_6923 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_6923) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))) is different from false [2024-10-26 03:20:55,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:55,006 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 30 treesize of output 36 [2024-10-26 03:20:55,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:55,010 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 84 treesize of output 54 [2024-10-26 03:20:55,013 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 [2024-10-26 03:20:55,015 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 [2024-10-26 03:20:55,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:55,034 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 30 treesize of output 36 [2024-10-26 03:20:55,036 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:20:55,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:20:55,039 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 54 treesize of output 24 [2024-10-26 03:20:55,891 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 10 treesize of output 8 [2024-10-26 03:20:55,932 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:20:55,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848380393] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:20:55,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:20:55,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22, 16] total 49 [2024-10-26 03:20:55,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976942588] [2024-10-26 03:20:55,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:20:55,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-26 03:20:55,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:20:55,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-26 03:20:55,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1948, Unknown=25, NotChecked=276, Total=2450 [2024-10-26 03:20:55,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:20:55,936 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:20:55,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 8.510204081632653) internal successors, (417), 50 states have internal predecessors, (417), 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) [2024-10-26 03:20:55,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:55,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:55,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:20:55,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:55,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:55,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:55,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:20:55,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:20:55,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:20:55,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:20:55,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:20:55,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:20:55,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:21:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:21:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:21:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:21:02,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:21:02,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:21:02,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-10-26 03:21:02,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-10-26 03:21:02,465 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:21:02,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:21:02,466 INFO L85 PathProgramCache]: Analyzing trace with hash 935782280, now seen corresponding path program 4 times [2024-10-26 03:21:02,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:21:02,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365642406] [2024-10-26 03:21:02,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:21:02,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:21:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:21:03,429 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:21:03,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:21:03,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365642406] [2024-10-26 03:21:03,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365642406] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:21:03,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776396872] [2024-10-26 03:21:03,430 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-26 03:21:03,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:21:03,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:21:03,431 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:21:03,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-10-26 03:21:11,608 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-26 03:21:11,608 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:21:11,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-26 03:21:11,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:21:11,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-26 03:21:11,678 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:21:11,678 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 11 treesize of output 11 [2024-10-26 03:21:11,937 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 13 treesize of output 9 [2024-10-26 03:21:12,009 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 18 treesize of output 13 [2024-10-26 03:21:12,018 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 18 treesize of output 13 [2024-10-26 03:21:12,030 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 18 treesize of output 13 [2024-10-26 03:21:12,043 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 18 treesize of output 13 [2024-10-26 03:21:12,124 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 18 treesize of output 13 [2024-10-26 03:21:12,135 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 18 treesize of output 13 [2024-10-26 03:21:12,143 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 18 treesize of output 13 [2024-10-26 03:21:12,149 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 18 treesize of output 13 [2024-10-26 03:21:12,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:12,293 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 25 treesize of output 13 [2024-10-26 03:21:12,297 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 23 treesize of output 22 [2024-10-26 03:21:12,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:12,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 03:21:12,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:12,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 03:21:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:21:12,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:21:12,856 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7301 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_47| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.base_47| Int) (v_ArrVal_7302 Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_47|)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_7301))) (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_47| (store (select .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_47|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_47| v_ArrVal_7302))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_47|))) is different from false [2024-10-26 03:21:13,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:13,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 1 case distinctions, treesize of input 43 treesize of output 34 [2024-10-26 03:21:13,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:13,053 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 334 treesize of output 310 [2024-10-26 03:21:13,061 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 174 treesize of output 158 [2024-10-26 03:21:13,095 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 137 treesize of output 109 [2024-10-26 03:21:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 22 not checked. [2024-10-26 03:21:13,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776396872] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:21:13,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:21:13,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 41 [2024-10-26 03:21:13,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843626014] [2024-10-26 03:21:13,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:21:13,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-26 03:21:13,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:21:13,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-26 03:21:13,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1494, Unknown=1, NotChecked=78, Total=1722 [2024-10-26 03:21:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:21:13,599 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:21:13,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 9.804878048780488) internal successors, (402), 42 states have internal predecessors, (402), 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) [2024-10-26 03:21:13,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:13,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:13,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:13,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:13,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:13,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:13,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:21:13,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:13,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:21:13,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:13,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:21:13,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:21:13,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:21:13,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:21:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:21:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:21:20,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:20,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:21:20,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:21:20,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:21:20,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:21:20,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-10-26 03:21:20,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-10-26 03:21:20,961 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:21:20,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:21:20,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1589411602, now seen corresponding path program 1 times [2024-10-26 03:21:20,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:21:20,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304013567] [2024-10-26 03:21:20,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:21:20,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:21:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:21:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-26 03:21:21,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:21:21,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304013567] [2024-10-26 03:21:21,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304013567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:21:21,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:21:21,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-26 03:21:21,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352347065] [2024-10-26 03:21:21,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:21:21,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-26 03:21:21,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:21:21,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-26 03:21:21,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-10-26 03:21:21,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:21:21,552 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:21:21,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 14.285714285714286) internal successors, (200), 15 states have internal predecessors, (200), 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) [2024-10-26 03:21:21,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:21,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:21,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:21,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:21,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:21,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:21,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:21:21,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:21,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:21:21,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:21,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:21:21,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:21:21,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:21:21,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:21:21,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:21:23,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:23,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:23,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:23,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:23,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:23,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:23,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:21:23,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:21:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:21:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:21:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:21:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:21:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:21:23,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-26 03:21:23,937 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:21:23,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:21:23,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1753863764, now seen corresponding path program 1 times [2024-10-26 03:21:23,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:21:23,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317618213] [2024-10-26 03:21:23,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:21:23,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:21:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:21:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-26 03:21:24,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:21:24,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317618213] [2024-10-26 03:21:24,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317618213] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:21:24,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125128379] [2024-10-26 03:21:24,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:21:24,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:21:24,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:21:24,663 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:21:24,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-26 03:21:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:21:25,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-26 03:21:25,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:21:25,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-26 03:21:25,422 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:21:25,422 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 11 treesize of output 11 [2024-10-26 03:21:25,511 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 13 treesize of output 9 [2024-10-26 03:21:25,538 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 23 treesize of output 22 [2024-10-26 03:21:25,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:25,573 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 32 treesize of output 34 [2024-10-26 03:21:25,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:25,616 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 41 treesize of output 46 [2024-10-26 03:21:25,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:25,663 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 45 treesize of output 34 [2024-10-26 03:21:25,680 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 45 treesize of output 34 [2024-10-26 03:21:25,686 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-26 03:21:25,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:21:25,758 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7870 (Array Int Int)) (v_ArrVal_7871 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_7870) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_7871) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_7870 (Array Int Int)) (v_ArrVal_7871 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_7870) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_7871) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_7870 (Array Int Int)) (v_ArrVal_7871 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_7870) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_7871) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_7870 (Array Int Int)) (v_ArrVal_7871 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_7870) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_7871) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))) is different from false [2024-10-26 03:21:25,770 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base| (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)))) (and (forall ((v_ArrVal_7870 (Array Int Int)) (v_ArrVal_7871 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_7870) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_7871) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_7870 (Array Int Int)) (v_ArrVal_7871 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_7870) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_7871) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_7870 (Array Int Int)) (v_ArrVal_7871 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_7870) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_7871) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_7870 (Array Int Int)) (v_ArrVal_7871 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_7870) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_7871) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))))) is different from false [2024-10-26 03:21:25,781 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base| (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)))) (and (forall ((v_ArrVal_7870 (Array Int Int)) (v_ArrVal_7871 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_7870) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_7871) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_7870 (Array Int Int)) (v_ArrVal_7871 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_7870) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_7871) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_7870 (Array Int Int)) (v_ArrVal_7871 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_7870) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_7871) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)))) (forall ((v_ArrVal_7870 (Array Int Int)) (v_ArrVal_7871 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_7870) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_7871) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))))) is different from false [2024-10-26 03:21:25,792 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) (.cse3 (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) (.cse1 (+ 7 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)))) (and (forall ((v_ArrVal_7870 (Array Int Int)) (v_ArrVal_7871 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_7870) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_7871) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_7870 (Array Int Int)) (v_ArrVal_7871 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_7870) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_7871) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse2))) (forall ((v_ArrVal_7870 (Array Int Int)) (v_ArrVal_7871 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_7870) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_7871) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_7870 (Array Int Int)) (v_ArrVal_7871 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_7870) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_7871) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse3) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))))) is different from false [2024-10-26 03:21:25,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:25,804 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 40 treesize of output 56 [2024-10-26 03:21:25,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:25,808 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 226 treesize of output 130 [2024-10-26 03:21:25,815 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 [2024-10-26 03:21:25,818 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 17 treesize of output 13 [2024-10-26 03:21:25,829 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:21:25,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1 [2024-10-26 03:21:25,833 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:21:25,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1 [2024-10-26 03:21:25,837 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:21:25,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1 [2024-10-26 03:21:26,260 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 10 treesize of output 8 [2024-10-26 03:21:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 2 not checked. [2024-10-26 03:21:26,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125128379] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:21:26,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:21:26,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 39 [2024-10-26 03:21:26,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45137583] [2024-10-26 03:21:26,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:21:26,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-26 03:21:26,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:21:26,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-26 03:21:26,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1128, Unknown=12, NotChecked=284, Total=1560 [2024-10-26 03:21:26,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:21:26,296 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:21:26,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 10.153846153846153) internal successors, (396), 40 states have internal predecessors, (396), 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) [2024-10-26 03:21:26,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:26,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:26,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:26,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:26,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:26,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:26,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:21:26,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:26,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:21:26,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:26,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:21:26,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:21:26,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:21:26,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:21:26,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:21:26,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:21:29,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:29,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:29,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:29,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:29,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:29,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:29,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:21:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:21:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:21:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:21:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:21:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:21:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:21:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:21:29,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-10-26 03:21:29,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:21:29,404 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:21:29,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:21:29,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1160357859, now seen corresponding path program 1 times [2024-10-26 03:21:29,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:21:29,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937900312] [2024-10-26 03:21:29,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:21:29,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:21:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:21:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:21:30,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:21:30,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937900312] [2024-10-26 03:21:30,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937900312] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:21:30,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350501002] [2024-10-26 03:21:30,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:21:30,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:21:30,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:21:30,132 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:21:30,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-26 03:21:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:21:30,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-26 03:21:30,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:21:30,798 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-26 03:21:30,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 03:21:30,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:30,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 03:21:30,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:30,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 03:21:30,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:30,967 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 45 treesize of output 34 [2024-10-26 03:21:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:21:30,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:21:30,987 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8154 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8154) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8154 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8154) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (forall ((v_ArrVal_8154 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8154) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (forall ((v_ArrVal_8154 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8154) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) is different from false [2024-10-26 03:21:31,046 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_8154 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8154) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8154 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8154) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8154 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8154) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8154 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8154) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))))))) is different from false [2024-10-26 03:21:31,060 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_8154 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8154) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8154 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8154) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8154 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8154) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8154 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8154) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))))))) is different from false [2024-10-26 03:21:31,075 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse3 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse1 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_8154 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8154) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1))) (forall ((v_ArrVal_8154 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8154) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8154 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8154) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse3))) (forall ((v_ArrVal_8154 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8154) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))))) is different from false [2024-10-26 03:21:31,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:31,089 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 37 treesize of output 53 [2024-10-26 03:21:31,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:31,094 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 86 treesize of output 32 [2024-10-26 03:21:31,100 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:21:31,101 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:21:31,105 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:21:31,105 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:21:31,109 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:21:31,109 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:21:31,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:21:31,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350501002] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:21:31,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:21:31,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2024-10-26 03:21:31,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83665851] [2024-10-26 03:21:31,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:21:31,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-26 03:21:31,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:21:31,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-26 03:21:31,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=710, Unknown=4, NotChecked=228, Total=1056 [2024-10-26 03:21:31,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:21:31,309 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:21:31,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 11.71875) internal successors, (375), 33 states have internal predecessors, (375), 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) [2024-10-26 03:21:31,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:31,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:31,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:31,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:31,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:31,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:31,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:21:31,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:31,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:21:31,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:31,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:21:31,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:21:31,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:21:31,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:21:31,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:21:31,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:21:31,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:21:33,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:33,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:33,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:33,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:33,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:33,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:33,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:21:33,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:33,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:21:33,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:33,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:21:33,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:21:33,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:21:33,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:21:33,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:21:33,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:21:33,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:21:33,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-10-26 03:21:33,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2024-10-26 03:21:33,666 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:21:33,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:21:33,667 INFO L85 PathProgramCache]: Analyzing trace with hash 521069621, now seen corresponding path program 1 times [2024-10-26 03:21:33,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:21:33,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488384310] [2024-10-26 03:21:33,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:21:33,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:21:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:21:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:21:35,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:21:35,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488384310] [2024-10-26 03:21:35,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488384310] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:21:35,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888043683] [2024-10-26 03:21:35,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:21:35,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:21:35,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:21:35,425 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:21:35,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-10-26 03:21:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:21:35,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-26 03:21:35,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:21:36,395 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-26 03:21:36,424 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 23 treesize of output 22 [2024-10-26 03:21:36,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 03:21:36,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 03:21:36,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:36,661 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 45 treesize of output 34 [2024-10-26 03:21:36,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:36,688 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 45 treesize of output 34 [2024-10-26 03:21:36,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:36,709 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 45 treesize of output 34 [2024-10-26 03:21:36,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:36,730 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 45 treesize of output 34 [2024-10-26 03:21:36,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:36,876 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 45 treesize of output 34 [2024-10-26 03:21:36,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:36,897 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 45 treesize of output 34 [2024-10-26 03:21:36,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:36,918 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 45 treesize of output 34 [2024-10-26 03:21:36,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:36,933 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 45 treesize of output 34 [2024-10-26 03:21:37,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:37,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:37,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:37,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:37,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:37,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 49 [2024-10-26 03:21:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:21:37,239 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:21:39,287 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8504 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_53| Int) (v_ArrVal_8506 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_53| Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_53|) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8504))) (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_53| (store (select .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_53| v_ArrVal_8506))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))))) (forall ((v_ArrVal_8504 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_53| Int) (v_ArrVal_8506 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_53| Int)) (or (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8504))) (store .cse1 |v_t1_funThread2of2ForFork2_init_~p#1.base_53| (store (select .cse1 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_53| v_ArrVal_8506))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_53|))) (forall ((v_ArrVal_8504 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_53| Int) (v_ArrVal_8506 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_53| Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8504))) (store .cse2 |v_t1_funThread2of2ForFork2_init_~p#1.base_53| (store (select .cse2 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_53| v_ArrVal_8506))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_53|))) (forall ((v_ArrVal_8504 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_53| Int) (v_ArrVal_8506 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_53| Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8504))) (store .cse3 |v_t1_funThread2of2ForFork2_init_~p#1.base_53| (store (select .cse3 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_53| v_ArrVal_8506))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_53|)))) is different from false [2024-10-26 03:21:40,307 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse1 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse4 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_8504 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_53| Int) (v_ArrVal_8506 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_53| Int)) (or (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8504))) (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_53| (store (select .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_53| v_ArrVal_8506))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_53|))) (forall ((v_ArrVal_8504 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_53| Int) (v_ArrVal_8506 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_53| Int)) (or (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8504))) (store .cse2 |v_t1_funThread2of2ForFork2_init_~p#1.base_53| (store (select .cse2 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_53| v_ArrVal_8506))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_53|))) (forall ((v_ArrVal_8504 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_53| Int) (v_ArrVal_8506 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_53| Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|)) (= (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8504))) (store .cse3 |v_t1_funThread2of2ForFork2_init_~p#1.base_53| (store (select .cse3 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_53| v_ArrVal_8506))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse4) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_53|))) (forall ((v_ArrVal_8504 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_53| Int) (v_ArrVal_8506 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_53| Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|)) (= (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8504))) (store .cse5 |v_t1_funThread2of2ForFork2_init_~p#1.base_53| (store (select .cse5 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_53| v_ArrVal_8506))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_53|)))))) is different from false [2024-10-26 03:21:40,350 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse6 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse1 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse6 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_8504 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_53| Int) (v_ArrVal_8506 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_53| Int)) (or (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8504))) (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_53| (store (select .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_53| v_ArrVal_8506))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2)) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_53|))) (forall ((v_ArrVal_8504 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_53| Int) (v_ArrVal_8506 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_53| Int)) (or (= (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8504))) (store .cse3 |v_t1_funThread2of2ForFork2_init_~p#1.base_53| (store (select .cse3 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_53| v_ArrVal_8506))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_53|))) (forall ((v_ArrVal_8504 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_53| Int) (v_ArrVal_8506 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_53| Int)) (or (= (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8504))) (store .cse4 |v_t1_funThread2of2ForFork2_init_~p#1.base_53| (store (select .cse4 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_53| v_ArrVal_8506))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_53|))) (forall ((v_ArrVal_8504 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_53| Int) (v_ArrVal_8506 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_53| Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8504))) (store .cse5 |v_t1_funThread2of2ForFork2_init_~p#1.base_53| (store (select .cse5 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_53| v_ArrVal_8506))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_53|)))))) is different from false [2024-10-26 03:21:40,398 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse7 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse4 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse1 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse7 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse4 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_8504 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_53| Int) (v_ArrVal_8506 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_53| Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_53|) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8504))) (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_53| (store (select .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_53| v_ArrVal_8506))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2)))) (forall ((v_ArrVal_8504 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_53| Int) (v_ArrVal_8506 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_53| Int)) (or (= (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8504))) (store .cse3 |v_t1_funThread2of2ForFork2_init_~p#1.base_53| (store (select .cse3 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_53| v_ArrVal_8506))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse4) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_53|))) (forall ((v_ArrVal_8504 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_53| Int) (v_ArrVal_8506 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_53| Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_53|) (= (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8504))) (store .cse5 |v_t1_funThread2of2ForFork2_init_~p#1.base_53| (store (select .cse5 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_53| v_ArrVal_8506))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (forall ((v_ArrVal_8504 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_53| Int) (v_ArrVal_8506 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_53| Int)) (or (= (select (select (let ((.cse6 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8504))) (store .cse6 |v_t1_funThread2of2ForFork2_init_~p#1.base_53| (store (select .cse6 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_53| v_ArrVal_8506))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse7) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_53|)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_53|)))))) is different from false [2024-10-26 03:21:40,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:40,417 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 73 treesize of output 64 [2024-10-26 03:21:40,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:40,425 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 446 treesize of output 394 [2024-10-26 03:21:40,433 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 174 treesize of output 158 [2024-10-26 03:21:40,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:40,540 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 79 treesize of output 43 [2024-10-26 03:21:40,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:40,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 64 [2024-10-26 03:21:40,573 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:21:40,582 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:21:40,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 142 treesize of output 120 [2024-10-26 03:21:40,591 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 [2024-10-26 03:21:40,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 70 [2024-10-26 03:21:40,626 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:21:40,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 1 [2024-10-26 03:21:40,634 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:21:40,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 1 [2024-10-26 03:21:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 22 not checked. [2024-10-26 03:21:41,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888043683] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:21:41,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:21:41,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 51 [2024-10-26 03:21:41,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735904467] [2024-10-26 03:21:41,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:21:41,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-26 03:21:41,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:21:41,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-26 03:21:41,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2065, Unknown=4, NotChecked=380, Total=2652 [2024-10-26 03:21:41,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:21:41,162 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:21:41,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 9.843137254901961) internal successors, (502), 52 states have internal predecessors, (502), 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) [2024-10-26 03:21:41,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:41,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:41,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:41,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:41,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:41,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:41,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:21:41,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:41,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:21:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:21:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:21:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:21:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:21:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:21:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:21:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:21:41,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:21:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:21:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:45,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:21:45,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:45,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:21:45,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:21:45,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:21:45,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:21:45,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:21:45,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:21:45,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:21:45,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:21:45,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-10-26 03:21:45,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-10-26 03:21:45,782 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:21:45,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:21:45,782 INFO L85 PathProgramCache]: Analyzing trace with hash 198216464, now seen corresponding path program 1 times [2024-10-26 03:21:45,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:21:45,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615979060] [2024-10-26 03:21:45,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:21:45,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:21:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:21:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:21:48,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:21:48,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615979060] [2024-10-26 03:21:48,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615979060] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:21:48,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169630069] [2024-10-26 03:21:48,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:21:48,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:21:48,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:21:48,158 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:21:48,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-10-26 03:21:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:21:48,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-26 03:21:48,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:21:48,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-26 03:21:48,813 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 03:21:48,813 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 [2024-10-26 03:21:48,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:48,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 19 treesize of output 12 [2024-10-26 03:21:48,949 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 03:21:48,950 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 [2024-10-26 03:21:49,156 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-26 03:21:49,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 03:21:49,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:49,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 03:21:49,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:49,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 03:21:49,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:49,407 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 45 treesize of output 34 [2024-10-26 03:21:49,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:49,421 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 45 treesize of output 34 [2024-10-26 03:21:49,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:49,433 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 45 treesize of output 34 [2024-10-26 03:21:49,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:49,444 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 45 treesize of output 34 [2024-10-26 03:21:49,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:49,553 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 45 treesize of output 34 [2024-10-26 03:21:49,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:49,567 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 45 treesize of output 34 [2024-10-26 03:21:49,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:49,579 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 45 treesize of output 34 [2024-10-26 03:21:49,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:21:49,595 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 45 treesize of output 34 [2024-10-26 03:21:49,691 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:21:49,691 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 11 treesize of output 11 [2024-10-26 03:21:49,907 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 45 treesize of output 34 [2024-10-26 03:21:49,923 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 45 treesize of output 34 [2024-10-26 03:21:49,936 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 45 treesize of output 34 [2024-10-26 03:21:49,951 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 45 treesize of output 34 [2024-10-26 03:21:50,005 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 45 treesize of output 34 [2024-10-26 03:21:50,011 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:21:50,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:21:50,150 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8893 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_8893) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8893 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_8893) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (forall ((v_ArrVal_8893 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_8893) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8893 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_8893) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) is different from false [2024-10-26 03:21:50,164 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8893 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_8893) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8893 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_8893) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8893 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_8893) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8893 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_8893) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))))) is different from false [2024-10-26 03:21:50,178 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8893 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_8893) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8893 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_8893) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8893 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_8893) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8893 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_8893) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) is different from false [2024-10-26 03:21:51,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:51,248 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 40 treesize of output 56 [2024-10-26 03:21:51,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:51,254 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 194 treesize of output 122 [2024-10-26 03:21:51,257 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 17 treesize of output 13 [2024-10-26 03:21:51,260 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 [2024-10-26 03:21:51,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:51,276 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 40 treesize of output 56 [2024-10-26 03:21:51,278 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:21:51,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:51,281 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 86 treesize of output 32 [2024-10-26 03:21:51,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:51,292 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 40 treesize of output 56 [2024-10-26 03:21:51,294 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:21:51,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:51,297 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 86 treesize of output 32 [2024-10-26 03:21:51,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:51,308 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 40 treesize of output 56 [2024-10-26 03:21:51,310 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:21:51,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:21:51,314 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 86 treesize of output 32 [2024-10-26 03:21:52,731 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:21:52,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169630069] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:21:52,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:21:52,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2024-10-26 03:21:52,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605590237] [2024-10-26 03:21:52,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:21:52,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-26 03:21:52,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:21:52,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-26 03:21:52,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1951, Unknown=36, NotChecked=276, Total=2450 [2024-10-26 03:21:52,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:21:52,734 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:21:52,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 10.46938775510204) internal successors, (513), 50 states have internal predecessors, (513), 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) [2024-10-26 03:21:52,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:52,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:52,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:52,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:52,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:52,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:52,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:21:52,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:52,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:21:52,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:52,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:21:52,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:21:52,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:21:52,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:21:52,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:21:52,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:21:52,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:21:52,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:21:52,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:21:57,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:57,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:57,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:57,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:57,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:57,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:57,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:21:57,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:21:57,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:21:57,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:21:57,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:21:57,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:21:57,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:21:57,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:21:57,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:21:57,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:21:57,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:21:57,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:21:57,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:21:57,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-10-26 03:21:57,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-10-26 03:21:57,923 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:21:57,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:21:57,924 INFO L85 PathProgramCache]: Analyzing trace with hash 431611715, now seen corresponding path program 2 times [2024-10-26 03:21:57,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:21:57,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395879811] [2024-10-26 03:21:57,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:21:57,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:21:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:21:59,309 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:21:59,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:21:59,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395879811] [2024-10-26 03:21:59,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395879811] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:21:59,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443117449] [2024-10-26 03:21:59,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 03:21:59,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:21:59,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:21:59,311 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:21:59,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-10-26 03:22:00,095 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 03:22:00,095 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:22:00,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-26 03:22:00,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:22:00,559 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-26 03:22:00,589 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 23 treesize of output 22 [2024-10-26 03:22:00,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 03:22:00,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:22:00,738 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 36 treesize of output 27 [2024-10-26 03:22:00,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:22:00,748 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 36 treesize of output 27 [2024-10-26 03:22:00,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:22:00,764 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 36 treesize of output 27 [2024-10-26 03:22:00,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:22:00,778 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 36 treesize of output 27 [2024-10-26 03:22:00,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:22:00,896 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 36 treesize of output 27 [2024-10-26 03:22:00,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:22:00,908 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 36 treesize of output 27 [2024-10-26 03:22:00,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:22:00,924 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 36 treesize of output 27 [2024-10-26 03:22:00,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:22:00,937 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 36 treesize of output 27 [2024-10-26 03:22:01,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:22:01,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:22:01,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:22:01,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:22:01,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 37 [2024-10-26 03:22:01,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:22:01,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 03:22:01,231 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:22:01,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:22:03,395 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_59| Int)) (or (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_59| Int)) (or (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_59|) (forall ((v_ArrVal_9244 Int)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_59| (store (select |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_59|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_59| v_ArrVal_9244)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))))) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.base| |v_t1_funThread2of2ForFork2_init_~p#1.base_59|))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_59| Int)) (or (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_59| Int)) (or (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_59|) (forall ((v_ArrVal_9244 Int)) (= (select (select (store |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_59| (store (select |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_59|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_59| v_ArrVal_9244)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.base| |v_t1_funThread2of2ForFork2_init_~p#1.base_59|))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_59| Int)) (or (< |c_t1_funThread2of2ForFork2_init_#in~p#1.base| |v_t1_funThread2of2ForFork2_init_~p#1.base_59|) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_59| Int)) (or (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_59|) (forall ((v_ArrVal_9244 Int)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_59| (store (select |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_59|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_59| v_ArrVal_9244)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))))))))) is different from false [2024-10-26 03:22:04,582 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9244 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_59| Int) (v_ArrVal_9242 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_59| Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_59|)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9242))) (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_59| (store (select .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_59|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_59| v_ArrVal_9244))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_59|))) (forall ((v_ArrVal_9244 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_59| Int) (v_ArrVal_9242 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_59| Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_59|)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9242))) (store .cse1 |v_t1_funThread2of2ForFork2_init_~p#1.base_59| (store (select .cse1 |v_t1_funThread2of2ForFork2_init_~p#1.base_59|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_59| v_ArrVal_9244))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_59|))) (forall ((v_ArrVal_9244 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_59| Int) (v_ArrVal_9242 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_59| Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_59|)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9242))) (store .cse2 |v_t1_funThread2of2ForFork2_init_~p#1.base_59| (store (select .cse2 |v_t1_funThread2of2ForFork2_init_~p#1.base_59|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_59| v_ArrVal_9244))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_59|)))) is different from false [2024-10-26 03:22:07,146 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse1 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_9244 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_59| Int) (v_ArrVal_9242 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_59| Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_59|)) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9242))) (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_59| (store (select .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_59|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_59| v_ArrVal_9244))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_59|))) (forall ((v_ArrVal_9244 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_59| Int) (v_ArrVal_9242 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_59| Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_59|)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9242))) (store .cse3 |v_t1_funThread2of2ForFork2_init_~p#1.base_59| (store (select .cse3 |v_t1_funThread2of2ForFork2_init_~p#1.base_59|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_59| v_ArrVal_9244))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_59|))) (forall ((v_ArrVal_9244 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_59| Int) (v_ArrVal_9242 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_59| Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_59|)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_59|) (= (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9242))) (store .cse4 |v_t1_funThread2of2ForFork2_init_~p#1.base_59| (store (select .cse4 |v_t1_funThread2of2ForFork2_init_~p#1.base_59|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_59| v_ArrVal_9244))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))))) is different from false [2024-10-26 03:22:07,179 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse3 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse1 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse5 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_9244 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_59| Int) (v_ArrVal_9242 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_59| Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_59|)) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9242))) (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_59| (store (select .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_59|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_59| v_ArrVal_9244))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_59|))) (forall ((v_ArrVal_9244 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_59| Int) (v_ArrVal_9242 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_59| Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_59|)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9242))) (store .cse2 |v_t1_funThread2of2ForFork2_init_~p#1.base_59| (store (select .cse2 |v_t1_funThread2of2ForFork2_init_~p#1.base_59|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_59| v_ArrVal_9244))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse3)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_59|))) (forall ((v_ArrVal_9244 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_59| Int) (v_ArrVal_9242 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_59| Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_59|)) (= (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9242))) (store .cse4 |v_t1_funThread2of2ForFork2_init_~p#1.base_59| (store (select .cse4 |v_t1_funThread2of2ForFork2_init_~p#1.base_59|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_59| v_ArrVal_9244))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse5) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_59|)))))) is different from false [2024-10-26 03:22:07,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:22:07,193 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 63 treesize of output 54 [2024-10-26 03:22:07,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:22:07,200 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 430 treesize of output 382 [2024-10-26 03:22:07,206 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 174 treesize of output 158 [2024-10-26 03:22:07,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:22:07,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 67 treesize of output 39 [2024-10-26 03:22:07,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:22:07,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 54 [2024-10-26 03:22:07,290 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:22:07,296 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:22:07,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 126 treesize of output 108 [2024-10-26 03:22:07,302 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 [2024-10-26 03:22:07,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 66 [2024-10-26 03:22:07,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:22:07,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 54 [2024-10-26 03:22:07,331 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:22:07,338 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:22:07,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 126 treesize of output 108 [2024-10-26 03:22:07,344 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 [2024-10-26 03:22:07,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 66 [2024-10-26 03:22:07,843 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 22 not checked. [2024-10-26 03:22:07,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443117449] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:22:07,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:22:07,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 51 [2024-10-26 03:22:07,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545202078] [2024-10-26 03:22:07,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:22:07,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-26 03:22:07,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:22:07,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-26 03:22:07,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2067, Unknown=4, NotChecked=380, Total=2652 [2024-10-26 03:22:07,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:22:07,846 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:22:07,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 9.843137254901961) internal successors, (502), 52 states have internal predecessors, (502), 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) [2024-10-26 03:22:07,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:22:07,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:22:07,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:22:07,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:22:07,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:22:07,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:22:07,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:22:07,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:22:07,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:22:07,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:22:07,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:22:07,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:22:07,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:22:07,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:22:07,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:22:07,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:22:07,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:22:07,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:22:07,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:22:07,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:22:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:22:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:22:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:22:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:22:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:22:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:22:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:22:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:22:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:22:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:22:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:22:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:22:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:22:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:22:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:22:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:22:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:22:12,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:22:12,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:22:12,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:22:12,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-10-26 03:22:12,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,29 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:22:12,630 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:22:12,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:22:12,630 INFO L85 PathProgramCache]: Analyzing trace with hash -250701794, now seen corresponding path program 2 times [2024-10-26 03:22:12,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:22:12,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582300492] [2024-10-26 03:22:12,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:22:12,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:22:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:22:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:22:14,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:22:14,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582300492] [2024-10-26 03:22:14,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582300492] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:22:14,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943259928] [2024-10-26 03:22:14,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 03:22:14,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:22:14,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:22:14,714 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:22:14,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-10-26 03:22:15,915 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 03:22:15,915 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:22:15,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-10-26 03:22:15,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:22:15,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-26 03:22:16,048 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 03:22:16,048 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 [2024-10-26 03:22:16,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:22:16,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-26 03:22:16,231 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-26 03:22:16,231 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 [2024-10-26 03:22:16,520 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 03:22:16,551 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 19 treesize of output 18 [2024-10-26 03:22:16,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-10-26 03:22:16,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:22:16,698 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 30 treesize of output 21 [2024-10-26 03:22:16,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:22:16,710 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 30 treesize of output 21 [2024-10-26 03:22:16,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:22:16,722 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 30 treesize of output 21 [2024-10-26 03:22:16,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:22:16,734 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 30 treesize of output 21 [2024-10-26 03:22:16,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:22:16,836 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 30 treesize of output 21 [2024-10-26 03:22:16,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:22:16,846 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 30 treesize of output 21 [2024-10-26 03:22:16,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:22:16,864 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 30 treesize of output 21 [2024-10-26 03:22:16,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:22:16,876 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 30 treesize of output 21 [2024-10-26 03:22:16,914 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:22:16,914 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 11 treesize of output 11 [2024-10-26 03:22:17,091 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 30 treesize of output 21 [2024-10-26 03:22:17,107 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 33 treesize of output 38 [2024-10-26 03:22:17,170 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 42 treesize of output 50 [2024-10-26 03:22:17,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 59 [2024-10-26 03:22:17,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 62 [2024-10-26 03:22:17,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 62 [2024-10-26 03:22:21,419 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:22:21,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:22:22,526 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 1)) (.cse3 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 2)) (.cse4 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 3)) (.cse5 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 4)) (.cse6 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((v_ArrVal_9634 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_9628 (Array Int Int)) (v_ArrVal_9633 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_9628))) (let ((.cse0 (store (select .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select (store .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse4 v_ArrVal_9633) .cse5 v_ArrVal_9634)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_9634 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_9628 (Array Int Int)) (v_ArrVal_9633 Int)) (= (select (select (let ((.cse8 (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_9628))) (let ((.cse7 (store (select .cse8 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse7) |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select (store .cse8 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse7) |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse4 v_ArrVal_9633) .cse5 v_ArrVal_9634)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_9634 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_9628 (Array Int Int)) (v_ArrVal_9633 Int)) (= (select (select (let ((.cse10 (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_9628))) (let ((.cse9 (store (select .cse10 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse9) |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select (store .cse10 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse9) |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse4 v_ArrVal_9633) .cse5 v_ArrVal_9634)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_9634 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_9628 (Array Int Int)) (v_ArrVal_9633 Int)) (= (select (select (let ((.cse12 (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_9628))) (let ((.cse11 (store (select .cse12 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse11) |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select (store .cse12 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse11) |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse4 v_ArrVal_9633) .cse5 v_ArrVal_9634)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) is different from false [2024-10-26 03:22:22,612 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int)) (or (forall ((v_ArrVal_9634 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_9628 (Array Int Int)) (v_ArrVal_9633 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_9628))) (let ((.cse0 (store (select .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| (store (store (store (store (select (store .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_init_#in~p#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) v_ArrVal_9633) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 4) v_ArrVal_9634)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int)) (or (forall ((v_ArrVal_9634 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_9628 (Array Int Int)) (v_ArrVal_9633 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_9628))) (let ((.cse3 (store (select .cse4 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse3) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| (store (store (store (store (select (store .cse4 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse3) |c_t1_funThread2of2ForFork2_init_#in~p#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) v_ArrVal_9633) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 4) v_ArrVal_9634)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int)) (or (forall ((v_ArrVal_9634 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_9628 (Array Int Int)) (v_ArrVal_9633 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_9628))) (let ((.cse5 (store (select .cse6 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse5) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| (store (store (store (store (select (store .cse6 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse5) |c_t1_funThread2of2ForFork2_init_#in~p#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) v_ArrVal_9633) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 4) v_ArrVal_9634)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int)) (or (forall ((v_ArrVal_9634 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_9628 (Array Int Int)) (v_ArrVal_9633 Int)) (= (select (select (let ((.cse8 (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_9628))) (let ((.cse7 (store (select .cse8 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse7) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| (store (store (store (store (select (store .cse8 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse7) |c_t1_funThread2of2ForFork2_init_#in~p#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) v_ArrVal_9633) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 4) v_ArrVal_9634)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|))))) is different from false [2024-10-26 03:22:22,702 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((v_ArrVal_9634 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_9628 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int) (v_ArrVal_9633 Int)) (or (= (select (select (let ((.cse1 (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_9628))) (let ((.cse0 (store (select .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_~p~1#1.base| (store (store (store (store (select (store .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_~p~1#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) v_ArrVal_9633) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 4) v_ArrVal_9634)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_t1_funThread2of2ForFork2_~p~1#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|))) (forall ((v_ArrVal_9634 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_9628 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int) (v_ArrVal_9633 Int)) (or (= (select (select (let ((.cse4 (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_9628))) (let ((.cse3 (store (select .cse4 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse3) |c_t1_funThread2of2ForFork2_~p~1#1.base| (store (store (store (store (select (store .cse4 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse3) |c_t1_funThread2of2ForFork2_~p~1#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) v_ArrVal_9633) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 4) v_ArrVal_9634)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_t1_funThread2of2ForFork2_~p~1#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|))) (forall ((v_ArrVal_9634 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_9628 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int) (v_ArrVal_9633 Int)) (or (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse6 (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_9628))) (let ((.cse5 (store (select .cse6 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse5) |c_t1_funThread2of2ForFork2_~p~1#1.base| (store (store (store (store (select (store .cse6 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse5) |c_t1_funThread2of2ForFork2_~p~1#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) v_ArrVal_9633) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 4) v_ArrVal_9634)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (< |c_t1_funThread2of2ForFork2_~p~1#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|))) (forall ((v_ArrVal_9634 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_9628 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int) (v_ArrVal_9633 Int)) (or (< |c_t1_funThread2of2ForFork2_~p~1#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse8 (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_9628))) (let ((.cse7 (store (select .cse8 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse7) |c_t1_funThread2of2ForFork2_~p~1#1.base| (store (store (store (store (select (store .cse8 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse7) |c_t1_funThread2of2ForFork2_~p~1#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) v_ArrVal_9633) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 4) v_ArrVal_9634)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2)))))) is different from false [2024-10-26 03:22:22,798 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((v_ArrVal_9634 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_9628 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int) (v_ArrVal_9633 Int)) (or (= (select (select (let ((.cse1 (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_9628))) (let ((.cse0 (store (select .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| (store (store (store (store (select (store .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) v_ArrVal_9633) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 4) v_ArrVal_9634)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_t1_funThread2of2ForFork2_#t~malloc16#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|))) (forall ((v_ArrVal_9634 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_9628 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int) (v_ArrVal_9633 Int)) (or (= (select (select (let ((.cse4 (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_9628))) (let ((.cse3 (store (select .cse4 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse3) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| (store (store (store (store (select (store .cse4 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse3) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) v_ArrVal_9633) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 4) v_ArrVal_9634)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_t1_funThread2of2ForFork2_#t~malloc16#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|))) (forall ((v_ArrVal_9634 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_9628 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int) (v_ArrVal_9633 Int)) (or (= (select (select (let ((.cse6 (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_9628))) (let ((.cse5 (store (select .cse6 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse5) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| (store (store (store (store (select (store .cse6 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse5) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) v_ArrVal_9633) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 4) v_ArrVal_9634)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_t1_funThread2of2ForFork2_#t~malloc16#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|))) (forall ((v_ArrVal_9634 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_9628 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int) (v_ArrVal_9633 Int)) (or (= (select (select (let ((.cse8 (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_9628))) (let ((.cse7 (store (select .cse8 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse7) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| (store (store (store (store (select (store .cse8 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse7) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) v_ArrVal_9633) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| 4) v_ArrVal_9634)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_t1_funThread2of2ForFork2_#t~malloc16#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|))))) is different from false [2024-10-26 03:22:28,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:22:28,075 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 142 treesize of output 132 [2024-10-26 03:22:28,079 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 334 treesize of output 298 [2024-10-26 03:22:28,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:22:28,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 140 treesize of output 104 [2024-10-26 03:22:28,091 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 8818 treesize of output 8690 [2024-10-26 03:22:28,116 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 17 treesize of output 13 [2024-10-26 03:22:28,167 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:22:28,168 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:22:28,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:22:28,174 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 35 treesize of output 46 [2024-10-26 03:22:28,176 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:22:28,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:22:28,180 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 70 treesize of output 28 [2024-10-26 03:22:28,184 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:22:28,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:22:28,190 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 35 treesize of output 46 [2024-10-26 03:22:28,192 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:22:28,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:22:28,205 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 54 treesize of output 24 [2024-10-26 03:22:42,004 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:22:42,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943259928] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:22:42,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:22:42,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 23] total 55 [2024-10-26 03:22:42,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209303527] [2024-10-26 03:22:42,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:22:42,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-10-26 03:22:42,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:22:42,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-10-26 03:22:42,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2421, Unknown=23, NotChecked=412, Total=3080 [2024-10-26 03:22:42,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:22:42,007 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:22:42,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 8.418181818181818) internal successors, (463), 56 states have internal predecessors, (463), 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) [2024-10-26 03:22:42,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:22:42,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:22:42,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:22:42,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:22:42,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:22:42,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:22:42,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:22:42,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:22:42,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:22:42,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:22:42,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:22:42,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:22:42,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:22:42,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:22:42,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:22:42,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:22:42,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:22:42,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:22:42,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:22:42,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:22:42,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:22:46,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:22:51,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:22:53,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:01,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:03,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:05,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:07,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:09,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:11,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:13,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:15,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:17,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:19,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:21,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:23,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:25,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:27,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:29,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:31,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:33,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:35,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:39,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:43,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:47,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:52,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:54,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:23:58,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:24:00,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:24:02,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:24:04,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:24:06,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:24:10,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:24:29,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:24:31,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:24:33,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:24:35,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:24:37,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:24:39,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:24:41,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:24:43,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:24:45,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:24:47,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:24:49,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:24:51,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:24:53,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:24:55,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:24:57,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:24:59,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:01,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:03,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:05,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:07,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:09,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:11,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:13,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:17,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:21,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:23,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:25,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:27,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:29,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:31,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:33,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:35,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:37,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:39,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:41,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:43,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:45,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:47,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:49,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:51,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:53,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:55,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:57,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:25:59,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:26:01,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:26:03,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:26:05,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:26:07,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:26:09,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:26:11,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:26:13,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:26:15,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:26:17,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:26:19,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:26:21,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:26:23,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:26:25,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:26:28,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:26:31,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:26:31,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:26:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:26:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:26:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:26:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:26:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:26:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:26:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:26:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:26:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:26:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:26:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:26:31,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:26:31,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2024-10-26 03:26:31,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,30 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:26:31,999 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:26:32,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:26:32,000 INFO L85 PathProgramCache]: Analyzing trace with hash 17722677, now seen corresponding path program 3 times [2024-10-26 03:26:32,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:26:32,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770364629] [2024-10-26 03:26:32,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:26:32,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:26:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:26:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:26:33,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:26:33,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770364629] [2024-10-26 03:26:33,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770364629] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:26:33,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145392851] [2024-10-26 03:26:33,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 03:26:33,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:26:33,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:26:33,123 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:26:33,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-10-26 03:26:35,027 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-26 03:26:35,028 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:26:35,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-26 03:26:35,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:26:35,672 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 03:26:35,707 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 19 treesize of output 18 [2024-10-26 03:26:35,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:35,876 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 23 treesize of output 16 [2024-10-26 03:26:35,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:35,884 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 23 treesize of output 16 [2024-10-26 03:26:35,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:35,900 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 23 treesize of output 16 [2024-10-26 03:26:35,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:35,917 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 23 treesize of output 16 [2024-10-26 03:26:36,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:36,012 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 23 treesize of output 16 [2024-10-26 03:26:36,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:36,020 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 23 treesize of output 16 [2024-10-26 03:26:36,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:36,036 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 23 treesize of output 16 [2024-10-26 03:26:36,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:36,048 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 23 treesize of output 16 [2024-10-26 03:26:36,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:36,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 03:26:36,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:36,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-10-26 03:26:36,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:36,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-10-26 03:26:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-26 03:26:36,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:26:38,365 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_65| Int)) (or (< |c_t1_funThread2of2ForFork2_init_#in~p#1.base| |v_t1_funThread2of2ForFork2_init_~p#1.base_65|) (forall ((v_ArrVal_9984 Int)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_65| (store (select |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_65|) |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| v_ArrVal_9984)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_65| Int)) (or (forall ((v_ArrVal_9984 Int)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_65| (store (select |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_65|) |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| v_ArrVal_9984)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.base| |v_t1_funThread2of2ForFork2_init_~p#1.base_65|)))) is different from false [2024-10-26 03:26:38,794 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9982 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_65| Int) (v_ArrVal_9984 Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_65|)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9982))) (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_65| (store (select .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_65|) 0 v_ArrVal_9984))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))))) (forall ((v_ArrVal_9982 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_65| Int) (v_ArrVal_9984 Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_65|)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9982))) (store .cse1 |v_t1_funThread2of2ForFork2_init_~p#1.base_65| (store (select .cse1 |v_t1_funThread2of2ForFork2_init_~p#1.base_65|) 0 v_ArrVal_9984))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) is different from false [2024-10-26 03:26:39,080 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse1 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_9982 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_65| Int) (v_ArrVal_9984 Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_65|)) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9982))) (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_65| (store (select .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_65|) 0 v_ArrVal_9984))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (forall ((v_ArrVal_9982 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_65| Int) (v_ArrVal_9984 Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_65|)) (= (select (select (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9982))) (store .cse2 |v_t1_funThread2of2ForFork2_init_~p#1.base_65| (store (select .cse2 |v_t1_funThread2of2ForFork2_init_~p#1.base_65|) 0 v_ArrVal_9984))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse3) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))))) is different from false [2024-10-26 03:26:39,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:39,091 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 53 treesize of output 44 [2024-10-26 03:26:39,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:39,098 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 210 treesize of output 190 [2024-10-26 03:26:39,106 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 [2024-10-26 03:26:39,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:39,180 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 55 treesize of output 35 [2024-10-26 03:26:39,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:39,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 44 [2024-10-26 03:26:39,202 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:26:39,212 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:26:39,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 78 treesize of output 72 [2024-10-26 03:26:39,221 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 [2024-10-26 03:26:39,236 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-10-26 03:26:39,237 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 76 treesize of output 62 [2024-10-26 03:26:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 22 not checked. [2024-10-26 03:26:40,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145392851] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:26:40,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:26:40,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 18] total 47 [2024-10-26 03:26:40,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860660975] [2024-10-26 03:26:40,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:26:40,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-26 03:26:40,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:26:40,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-26 03:26:40,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1792, Unknown=3, NotChecked=264, Total=2256 [2024-10-26 03:26:40,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:26:40,010 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:26:40,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 9.361702127659575) internal successors, (440), 48 states have internal predecessors, (440), 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) [2024-10-26 03:26:40,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:40,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:40,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:40,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:40,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:40,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:40,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:26:40,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:40,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:26:40,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:40,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:26:40,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:26:40,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:26:40,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:26:40,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:26:40,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:26:40,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:26:40,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:26:40,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:26:40,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:26:40,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:26:40,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:26:47,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:26:49,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:26:49,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:49,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:49,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:49,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:49,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:49,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:49,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:26:49,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:49,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:26:49,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:49,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:26:49,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:26:49,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:26:49,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:26:49,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:26:49,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:26:49,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:26:49,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:26:49,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:26:49,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:26:49,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:26:49,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-26 03:26:49,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2024-10-26 03:26:49,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2024-10-26 03:26:49,771 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:26:49,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:26:49,772 INFO L85 PathProgramCache]: Analyzing trace with hash 506926096, now seen corresponding path program 3 times [2024-10-26 03:26:49,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:26:49,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61133210] [2024-10-26 03:26:49,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:26:49,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:26:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:26:51,599 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:26:51,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:26:51,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61133210] [2024-10-26 03:26:51,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61133210] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:26:51,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094374958] [2024-10-26 03:26:51,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 03:26:51,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:26:51,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:26:51,601 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:26:51,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-10-26 03:26:54,733 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-26 03:26:54,734 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:26:54,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-10-26 03:26:54,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:26:54,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-26 03:26:54,900 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 03:26:54,900 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 [2024-10-26 03:26:55,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:55,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-26 03:26:55,105 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 03:26:55,105 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 [2024-10-26 03:26:55,375 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 03:26:55,412 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 19 treesize of output 18 [2024-10-26 03:26:55,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:55,511 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 23 treesize of output 16 [2024-10-26 03:26:55,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:55,522 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 23 treesize of output 16 [2024-10-26 03:26:55,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:55,530 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 23 treesize of output 16 [2024-10-26 03:26:55,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:55,541 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 23 treesize of output 16 [2024-10-26 03:26:55,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:55,628 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 23 treesize of output 16 [2024-10-26 03:26:55,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:55,644 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 23 treesize of output 16 [2024-10-26 03:26:55,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:55,651 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 23 treesize of output 16 [2024-10-26 03:26:55,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:55,665 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 23 treesize of output 16 [2024-10-26 03:26:55,694 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:26:55,694 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 11 treesize of output 11 [2024-10-26 03:26:55,778 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 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 03:26:55,788 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 [2024-10-26 03:26:55,829 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 33 treesize of output 38 [2024-10-26 03:26:55,874 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 [2024-10-26 03:26:55,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 55 [2024-10-26 03:26:55,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2024-10-26 03:26:56,071 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 0 case distinctions, treesize of input 48 treesize of output 33 [2024-10-26 03:26:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:26:56,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:26:56,122 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10377 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (forall ((v_ArrVal_10377 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (forall ((v_ArrVal_10377 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_10377 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) is different from false [2024-10-26 03:26:56,175 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_10377 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_10377 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_10377 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_10377 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))))) is different from false [2024-10-26 03:26:56,185 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse1 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_10377 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_10377 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2))) (forall ((v_ArrVal_10377 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_10377 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))))) is different from false [2024-10-26 03:26:56,199 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base|)) (.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse1 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((v_ArrVal_10368 Int) (v_ArrVal_10377 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.offset| v_ArrVal_10368)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (forall ((v_ArrVal_10368 Int) (v_ArrVal_10377 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.offset| v_ArrVal_10368)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (forall ((v_ArrVal_10368 Int) (v_ArrVal_10377 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.offset| v_ArrVal_10368)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_10368 Int) (v_ArrVal_10377 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.offset| v_ArrVal_10368)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) is different from false [2024-10-26 03:26:56,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base|)) (.cse1 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((v_ArrVal_10368 Int) (v_ArrVal_10377 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| (store .cse0 |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| v_ArrVal_10368)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_10368 Int) (v_ArrVal_10377 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| (store .cse0 |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| v_ArrVal_10368)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_10368 Int) (v_ArrVal_10377 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| (store .cse0 |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| v_ArrVal_10368)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_10368 Int) (v_ArrVal_10377 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| (store .cse0 |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| v_ArrVal_10368)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) is different from false [2024-10-26 03:26:56,250 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base|)) (.cse1 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((v_ArrVal_10368 Int) (v_ArrVal_10377 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| (store .cse0 |c_t1_funThread2of2ForFork2_~p~1#1.offset| v_ArrVal_10368)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2))) (forall ((v_ArrVal_10368 Int) (v_ArrVal_10377 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| (store .cse0 |c_t1_funThread2of2ForFork2_~p~1#1.offset| v_ArrVal_10368)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_10368 Int) (v_ArrVal_10377 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| (store .cse0 |c_t1_funThread2of2ForFork2_~p~1#1.offset| v_ArrVal_10368)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_10368 Int) (v_ArrVal_10377 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| (store .cse0 |c_t1_funThread2of2ForFork2_~p~1#1.offset| v_ArrVal_10368)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) is different from false [2024-10-26 03:26:56,272 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base|)) (.cse1 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((v_ArrVal_10368 Int) (v_ArrVal_10377 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| (store .cse0 |c_t1_funThread2of2ForFork2_#t~malloc16#1.offset| v_ArrVal_10368)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_10368 Int) (v_ArrVal_10377 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| (store .cse0 |c_t1_funThread2of2ForFork2_#t~malloc16#1.offset| v_ArrVal_10368)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_10368 Int) (v_ArrVal_10377 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| (store .cse0 |c_t1_funThread2of2ForFork2_#t~malloc16#1.offset| v_ArrVal_10368)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_10368 Int) (v_ArrVal_10377 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| (store .cse0 |c_t1_funThread2of2ForFork2_#t~malloc16#1.offset| v_ArrVal_10368)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_10377) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2))))) is different from false [2024-10-26 03:26:59,366 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:26:59,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:59,371 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 53 treesize of output 44 [2024-10-26 03:26:59,375 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:26:59,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:59,379 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 102 treesize of output 54 [2024-10-26 03:26:59,383 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 26 [2024-10-26 03:26:59,393 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:26:59,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:59,401 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 53 treesize of output 44 [2024-10-26 03:26:59,404 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:26:59,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:59,409 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 102 treesize of output 54 [2024-10-26 03:26:59,412 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 26 [2024-10-26 03:26:59,423 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:27:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:27:04,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094374958] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:27:04,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:27:04,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 20] total 51 [2024-10-26 03:27:04,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033847104] [2024-10-26 03:27:04,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:27:04,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-26 03:27:04,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:27:04,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-26 03:27:04,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1809, Unknown=12, NotChecked=644, Total=2652 [2024-10-26 03:27:04,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:27:04,939 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:27:04,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 9.03921568627451) internal successors, (461), 52 states have internal predecessors, (461), 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) [2024-10-26 03:27:04,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:04,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:04,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:27:04,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:04,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:04,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:04,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:27:04,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:04,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:27:04,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:27:04,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:27:04,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:27:04,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:27:04,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:27:04,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:27:04,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:04,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:27:04,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:04,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:04,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:27:04,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:27:04,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-10-26 03:27:04,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:27:12,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:27:14,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:27:16,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:27:18,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:27:21,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:21,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:21,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:27:21,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:21,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:21,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:21,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:27:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:27:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:27:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:27:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:27:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:27:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:27:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:27:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:27:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:27:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:27:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-10-26 03:27:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:27:21,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-10-26 03:27:21,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-10-26 03:27:21,388 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:27:21,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:27:21,389 INFO L85 PathProgramCache]: Analyzing trace with hash 196107843, now seen corresponding path program 4 times [2024-10-26 03:27:21,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:27:21,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977890608] [2024-10-26 03:27:21,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:27:21,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:27:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:27:22,363 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:27:22,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:27:22,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977890608] [2024-10-26 03:27:22,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977890608] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:27:22,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941308117] [2024-10-26 03:27:22,364 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-26 03:27:22,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:27:22,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:27:22,365 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:27:22,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-10-26 03:27:28,332 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-26 03:27:28,332 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:27:28,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-10-26 03:27:28,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:27:28,768 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 03:27:28,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:28,829 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 16 treesize of output 11 [2024-10-26 03:27:28,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:28,834 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 16 treesize of output 11 [2024-10-26 03:27:28,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:28,841 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 16 treesize of output 11 [2024-10-26 03:27:28,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:28,849 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 16 treesize of output 11 [2024-10-26 03:27:28,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:28,916 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 16 treesize of output 11 [2024-10-26 03:27:28,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:28,927 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 16 treesize of output 11 [2024-10-26 03:27:28,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:28,932 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 16 treesize of output 11 [2024-10-26 03:27:28,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:28,941 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 16 treesize of output 11 [2024-10-26 03:27:29,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:29,071 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 23 treesize of output 11 [2024-10-26 03:27:29,075 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 19 treesize of output 18 [2024-10-26 03:27:29,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:29,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-10-26 03:27:29,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:29,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-10-26 03:27:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:27:29,180 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:27:29,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:29,898 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 1 case distinctions, treesize of input 43 treesize of output 34 [2024-10-26 03:27:29,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:29,904 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 334 treesize of output 310 [2024-10-26 03:27:29,908 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 174 treesize of output 158 [2024-10-26 03:27:29,928 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 134 treesize of output 106 [2024-10-26 03:27:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:27:30,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941308117] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:27:30,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:27:30,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 18] total 47 [2024-10-26 03:27:30,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060734883] [2024-10-26 03:27:30,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:27:30,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-26 03:27:30,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:27:30,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-26 03:27:30,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2040, Unknown=23, NotChecked=0, Total=2256 [2024-10-26 03:27:30,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:27:30,396 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:27:30,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 9.27659574468085) internal successors, (436), 48 states have internal predecessors, (436), 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) [2024-10-26 03:27:30,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:30,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:30,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:27:30,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:30,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:30,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:30,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:27:30,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:30,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:27:30,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:27:30,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:27:30,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:27:30,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:27:30,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:27:30,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:27:30,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:30,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:27:30,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:30,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:30,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:27:30,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:27:30,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-10-26 03:27:30,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:27:30,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:27:35,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:27:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:27:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:27:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:27:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:27:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:27:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:27:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:27:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:27:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:27:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:27:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:27:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-10-26 03:27:35,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:27:35,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-26 03:27:35,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-10-26 03:27:35,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2024-10-26 03:27:35,229 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:27:35,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:27:35,229 INFO L85 PathProgramCache]: Analyzing trace with hash -2146035938, now seen corresponding path program 4 times [2024-10-26 03:27:35,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:27:35,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966312210] [2024-10-26 03:27:35,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:27:35,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:27:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:27:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:27:36,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:27:36,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966312210] [2024-10-26 03:27:36,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966312210] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:27:36,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510439664] [2024-10-26 03:27:36,951 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-26 03:27:36,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:27:36,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:27:36,952 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:27:36,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-10-26 03:27:50,045 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-26 03:27:50,045 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:27:50,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-10-26 03:27:50,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:27:50,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-26 03:27:50,183 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 03:27:50,183 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 [2024-10-26 03:27:50,222 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 03:27:50,223 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 [2024-10-26 03:27:50,352 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-10-26 03:27:50,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-10-26 03:27:50,782 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 13 treesize of output 9 [2024-10-26 03:27:50,939 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 18 treesize of output 13 [2024-10-26 03:27:50,953 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 18 treesize of output 13 [2024-10-26 03:27:50,963 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 18 treesize of output 13 [2024-10-26 03:27:50,969 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 18 treesize of output 13 [2024-10-26 03:27:51,071 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 18 treesize of output 13 [2024-10-26 03:27:51,076 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 18 treesize of output 13 [2024-10-26 03:27:51,087 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 18 treesize of output 13 [2024-10-26 03:27:51,093 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 18 treesize of output 13 [2024-10-26 03:27:51,169 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-26 03:27:51,169 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 [2024-10-26 03:27:51,293 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 18 treesize of output 13 [2024-10-26 03:27:51,298 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 23 treesize of output 22 [2024-10-26 03:27:51,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:51,307 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 32 treesize of output 34 [2024-10-26 03:27:51,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:51,316 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 41 treesize of output 46 [2024-10-26 03:27:51,327 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 45 treesize of output 34 [2024-10-26 03:27:51,337 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 45 treesize of output 34 [2024-10-26 03:27:51,349 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 45 treesize of output 34 [2024-10-26 03:27:51,389 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 45 treesize of output 34 [2024-10-26 03:27:51,400 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:27:51,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:27:51,423 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_11118 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11118 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11118 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11118 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) is different from false [2024-10-26 03:27:51,664 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse1 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_11118 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1))) (forall ((v_ArrVal_11118 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11118 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11118 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))))) is different from false [2024-10-26 03:27:51,861 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse1 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((v_ArrVal_11109 (Array Int Int)) (v_ArrVal_11118 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11109) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0))) (forall ((v_ArrVal_11109 (Array Int Int)) (v_ArrVal_11118 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11109) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1))) (forall ((v_ArrVal_11109 (Array Int Int)) (v_ArrVal_11118 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11109) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11109 (Array Int Int)) (v_ArrVal_11118 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11109) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) is different from false [2024-10-26 03:27:51,897 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse1 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((v_ArrVal_11109 (Array Int Int)) (v_ArrVal_11118 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_11109) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11109 (Array Int Int)) (v_ArrVal_11118 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_11109) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11109 (Array Int Int)) (v_ArrVal_11118 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_11109) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11109 (Array Int Int)) (v_ArrVal_11118 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_11109) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) is different from false [2024-10-26 03:27:51,924 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse1 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((v_ArrVal_11109 (Array Int Int)) (v_ArrVal_11118 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_11109) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11109 (Array Int Int)) (v_ArrVal_11118 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_11109) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11109 (Array Int Int)) (v_ArrVal_11118 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_11109) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11109 (Array Int Int)) (v_ArrVal_11118 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_11109) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) is different from false [2024-10-26 03:27:51,950 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse1 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((v_ArrVal_11109 (Array Int Int)) (v_ArrVal_11118 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_11109) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11109 (Array Int Int)) (v_ArrVal_11118 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_11109) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11109 (Array Int Int)) (v_ArrVal_11118 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_11109) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11109 (Array Int Int)) (v_ArrVal_11118 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_11109) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_11118) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) is different from false [2024-10-26 03:27:54,711 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:27:54,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:54,714 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 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-26 03:27:54,716 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:27:54,717 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 22 treesize of output 16 [2024-10-26 03:27:54,721 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:27:54,722 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:27:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:27:57,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510439664] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:27:57,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:27:57,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27, 19] total 56 [2024-10-26 03:27:57,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390320844] [2024-10-26 03:27:57,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:27:57,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-10-26 03:27:57,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:27:57,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-10-26 03:27:57,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2325, Unknown=49, NotChecked=618, Total=3192 [2024-10-26 03:27:57,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:27:57,897 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:27:57,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 9.303571428571429) internal successors, (521), 57 states have internal predecessors, (521), 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) [2024-10-26 03:27:57,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:57,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:57,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:27:57,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:57,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:57,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:57,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:27:57,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:57,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:27:57,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:27:57,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:27:57,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:27:57,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:27:57,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:27:57,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:27:57,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:57,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:27:57,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:57,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:57,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:27:57,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:27:57,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-10-26 03:27:57,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:27:57,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-10-26 03:27:57,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:28:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:28:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:28:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:28:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:28:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:28:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:28:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:28:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:28:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:28:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:28:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:28:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:28:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:28:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:28:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:28:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-10-26 03:28:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:28:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-26 03:28:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-26 03:28:08,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2024-10-26 03:28:08,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,34 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:28:08,233 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:28:08,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:28:08,233 INFO L85 PathProgramCache]: Analyzing trace with hash 360511841, now seen corresponding path program 1 times [2024-10-26 03:28:08,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:28:08,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476226443] [2024-10-26 03:28:08,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:28:08,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:28:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:28:09,248 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-26 03:28:09,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:28:09,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476226443] [2024-10-26 03:28:09,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476226443] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:28:09,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564485301] [2024-10-26 03:28:09,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:28:09,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:28:09,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:28:09,250 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:28:09,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-10-26 03:28:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:28:09,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-26 03:28:09,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:28:10,143 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-26 03:28:10,170 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 23 treesize of output 22 [2024-10-26 03:28:10,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:28:10,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 03:28:10,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:28:10,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 03:28:10,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:28:10,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:28:10,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:28:10,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:28:10,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:28:10,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 49 [2024-10-26 03:28:10,363 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-26 03:28:10,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:28:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-26 03:28:11,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564485301] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:28:11,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:28:11,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 45 [2024-10-26 03:28:11,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514469118] [2024-10-26 03:28:11,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:28:11,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-26 03:28:11,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:28:11,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-26 03:28:11,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1847, Unknown=0, NotChecked=0, Total=2070 [2024-10-26 03:28:11,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:28:11,525 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:28:11,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 11.088888888888889) internal successors, (499), 46 states have internal predecessors, (499), 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) [2024-10-26 03:28:11,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:11,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:28:11,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-10-26 03:28:11,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-10-26 03:28:11,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:28:16,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:28:16,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-10-26 03:28:16,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:28:16,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-26 03:28:16,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-26 03:28:16,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:28:16,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2024-10-26 03:28:16,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,35 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:28:16,513 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:28:16,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:28:16,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1356886768, now seen corresponding path program 5 times [2024-10-26 03:28:16,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:28:16,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606945744] [2024-10-26 03:28:16,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:28:16,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:28:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:28:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-26 03:28:18,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:28:18,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606945744] [2024-10-26 03:28:18,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606945744] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:28:18,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328647230] [2024-10-26 03:28:18,351 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-26 03:28:18,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:28:18,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:28:18,352 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:28:18,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-10-26 03:28:19,480 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-10-26 03:28:19,481 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:28:19,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-26 03:28:19,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:28:19,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-26 03:28:19,644 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 03:28:19,644 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 [2024-10-26 03:28:19,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:28:19,914 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-26 03:28:19,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 21 [2024-10-26 03:28:20,010 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 03:28:20,010 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 [2024-10-26 03:28:20,277 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:28:20,277 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 11 treesize of output 11 [2024-10-26 03:28:20,372 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 [2024-10-26 03:28:20,398 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 [2024-10-26 03:28:20,432 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 [2024-10-26 03:28:20,474 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 33 treesize of output 38 [2024-10-26 03:28:20,518 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 [2024-10-26 03:28:20,530 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 [2024-10-26 03:28:20,540 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 [2024-10-26 03:28:20,587 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 [2024-10-26 03:28:20,620 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-26 03:28:20,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:28:20,634 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_11843 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11843) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (forall ((v_ArrVal_11843 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11843) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11843 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11843) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11843 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11843) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) is different from false [2024-10-26 03:28:26,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:28:26,987 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 37 treesize of output 53 [2024-10-26 03:28:26,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:28:26,992 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 86 treesize of output 32 [2024-10-26 03:28:26,998 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:28:26,999 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:28:27,004 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:28:27,004 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:28:27,008 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:28:27,009 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:28:30,284 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-26 03:28:30,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328647230] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:28:30,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:28:30,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 19] total 48 [2024-10-26 03:28:30,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743295797] [2024-10-26 03:28:30,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:28:30,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-26 03:28:30,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:28:30,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-26 03:28:30,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2019, Unknown=39, NotChecked=92, Total=2352 [2024-10-26 03:28:30,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:28:30,287 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:28:30,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 9.291666666666666) internal successors, (446), 49 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:28:30,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:30,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:30,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:28:30,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:30,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:30,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:30,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:28:30,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:30,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:28:30,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:28:30,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:28:30,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:28:30,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:28:30,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:28:30,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:28:30,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:28:30,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:28:30,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:28:30,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:28:30,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:28:30,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:28:30,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-10-26 03:28:30,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:28:30,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-10-26 03:28:30,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-10-26 03:28:30,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:28:30,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:28:38,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:28:40,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:28:42,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:28:44,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:28:46,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:28:48,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:28:50,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:28:52,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:28:54,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:28:56,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:28:58,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:29:00,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:29:02,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:29:04,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:29:06,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:29:08,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:29:10,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:29:12,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:29:14,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:29:16,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:29:18,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:29:20,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:29:22,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:29:24,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:29:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:29:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:29:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:29:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:29:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:29:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:29:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:29:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:29:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:29:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:29:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:29:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:29:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:29:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:29:25,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:29:25,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-10-26 03:29:25,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:29:25,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-26 03:29:25,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-26 03:29:25,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-26 03:29:25,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:29:25,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2024-10-26 03:29:25,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2024-10-26 03:29:25,356 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:29:25,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:29:25,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1192799793, now seen corresponding path program 1 times [2024-10-26 03:29:25,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:29:25,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317669769] [2024-10-26 03:29:25,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:29:25,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:29:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:29:26,217 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-26 03:29:26,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:29:26,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317669769] [2024-10-26 03:29:26,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317669769] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:29:26,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197364243] [2024-10-26 03:29:26,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:29:26,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:29:26,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:29:26,220 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:29:26,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-10-26 03:29:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:29:26,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-26 03:29:26,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:29:27,693 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-26 03:29:27,736 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 23 treesize of output 22 [2024-10-26 03:29:27,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 03:29:27,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 03:29:27,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:29:27,920 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 45 treesize of output 34 [2024-10-26 03:29:27,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:29:27,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:29:27,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:29:27,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:29:27,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:29:27,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 49 [2024-10-26 03:29:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-26 03:29:28,034 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:29:28,429 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse1 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 1)) (.cse2 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse5 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_12190 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12190))) (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (forall ((v_ArrVal_12190 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse3 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12190))) (store .cse3 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse3 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_12190 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12190))) (store .cse4 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse4 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse5) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_12190 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12190))) (store .cse6 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse6 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))))) is different from false [2024-10-26 03:29:28,489 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse6 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse1 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 1)) (.cse2 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse4 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse6 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_12190 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12190))) (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (forall ((v_ArrVal_12190 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse3 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12190))) (store .cse3 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse3 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse4) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_12190 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12190))) (store .cse5 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse5 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_12190 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12190))) (store .cse7 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse7 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))))) is different from false [2024-10-26 03:29:28,511 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse4 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse8 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse1 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 1)) (.cse2 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse4 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse8 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_12190 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12190))) (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_12190 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse3 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12190))) (store .cse3 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse3 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse4))) (forall ((v_ArrVal_12190 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12190))) (store .cse5 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse5 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6))) (forall ((v_ArrVal_12190 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12190))) (store .cse7 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse7 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse8) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))))) is different from false [2024-10-26 03:29:28,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:29:28,525 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 75 treesize of output 66 [2024-10-26 03:29:28,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:29:28,532 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 462 treesize of output 410 [2024-10-26 03:29:28,538 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 178 treesize of output 162 [2024-10-26 03:29:28,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:29:28,676 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 120 treesize of output 72 [2024-10-26 03:29:28,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:29:28,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 66 [2024-10-26 03:29:28,702 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:29:28,709 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:29:28,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 146 treesize of output 124 [2024-10-26 03:29:28,715 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 [2024-10-26 03:29:28,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 70 [2024-10-26 03:29:28,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:29:28,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 66 [2024-10-26 03:29:28,757 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:29:28,764 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:29:28,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 114 treesize of output 100 [2024-10-26 03:29:28,770 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 [2024-10-26 03:29:28,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 66 [2024-10-26 03:29:28,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:29:28,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 66 [2024-10-26 03:29:28,810 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:29:28,818 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:29:28,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 114 treesize of output 100 [2024-10-26 03:29:28,824 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 [2024-10-26 03:29:28,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 66 [2024-10-26 03:29:29,838 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 22 refuted. 1 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-26 03:29:29,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197364243] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:29:29,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:29:29,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2024-10-26 03:29:29,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974383939] [2024-10-26 03:29:29,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:29:29,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-26 03:29:29,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:29:29,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-26 03:29:29,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2189, Unknown=13, NotChecked=288, Total=2652 [2024-10-26 03:29:29,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:29:29,843 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:29:29,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 9.73076923076923) internal successors, (506), 52 states have internal predecessors, (506), 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) [2024-10-26 03:29:29,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:29,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:29,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:29:29,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:29,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:29,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:29,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:29:29,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:29,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:29:29,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:29:29,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:29:29,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:29:29,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:29:29,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:29:29,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:29:29,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:29:29,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:29:29,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:29:29,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:29:29,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:29:29,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:29:29,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-10-26 03:29:29,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:29:29,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-10-26 03:29:29,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-10-26 03:29:29,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-26 03:29:29,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:29:29,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:29:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:29:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:29:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:29:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:29:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:29:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:29:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:29:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:29:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:29:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:29:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:29:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:29:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:29:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:29:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:29:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-10-26 03:29:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:29:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-26 03:29:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-26 03:29:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-26 03:29:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:29:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-26 03:29:40,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2024-10-26 03:29:41,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2024-10-26 03:29:41,092 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:29:41,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:29:41,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1324189762, now seen corresponding path program 6 times [2024-10-26 03:29:41,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:29:41,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898426602] [2024-10-26 03:29:41,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:29:41,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:29:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:29:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-26 03:29:42,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:29:42,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898426602] [2024-10-26 03:29:42,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898426602] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:29:42,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573974305] [2024-10-26 03:29:42,291 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-26 03:29:42,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:29:42,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:29:42,292 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:29:42,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-10-26 03:29:43,563 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-10-26 03:29:43,564 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:29:43,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-10-26 03:29:43,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:29:43,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-26 03:29:43,773 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 03:29:43,773 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 [2024-10-26 03:29:43,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:29:43,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-26 03:29:44,076 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-26 03:29:44,076 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 [2024-10-26 03:29:44,653 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:29:44,653 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 11 treesize of output 11 [2024-10-26 03:29:44,847 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 [2024-10-26 03:29:44,897 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 [2024-10-26 03:29:44,952 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 [2024-10-26 03:29:45,009 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 33 treesize of output 38 [2024-10-26 03:29:45,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:29:45,078 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 [2024-10-26 03:29:45,151 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 [2024-10-26 03:29:45,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 55 [2024-10-26 03:29:45,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2024-10-26 03:29:45,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2024-10-26 03:29:45,429 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-26 03:29:45,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:29:46,239 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 1)) (.cse2 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 2)) (.cse3 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 3)) (.cse4 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 4))) (and (forall ((v_ArrVal_12568 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_12574 Int) (v_ArrVal_12571 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12568))) (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 v_ArrVal_12571) .cse4 v_ArrVal_12574))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_12568 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_12574 Int) (v_ArrVal_12571 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12568))) (store .cse5 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select .cse5 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 v_ArrVal_12571) .cse4 v_ArrVal_12574))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_12568 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_12574 Int) (v_ArrVal_12571 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12568))) (store .cse6 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select .cse6 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 v_ArrVal_12571) .cse4 v_ArrVal_12574))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_12568 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_12574 Int) (v_ArrVal_12571 Int)) (= (select (select (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12568))) (store .cse7 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select .cse7 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 v_ArrVal_12571) .cse4 v_ArrVal_12574))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) is different from false [2024-10-26 03:29:46,293 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse1 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 1)) (.cse2 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 2)) (.cse3 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 3)) (.cse4 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 4)) (.cse5 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse7 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_12568 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_12574 Int) (v_ArrVal_12571 Int)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12568))) (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 v_ArrVal_12571) .cse4 v_ArrVal_12574))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (forall ((v_ArrVal_12568 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_12574 Int) (v_ArrVal_12571 Int)) (= (select (select (let ((.cse6 (store .cse5 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12568))) (store .cse6 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select .cse6 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 v_ArrVal_12571) .cse4 v_ArrVal_12574))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse7) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_12568 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_12574 Int) (v_ArrVal_12571 Int)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse8 (store .cse5 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12568))) (store .cse8 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select .cse8 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 v_ArrVal_12571) .cse4 v_ArrVal_12574))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (forall ((v_ArrVal_12568 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_12574 Int) (v_ArrVal_12571 Int)) (= (select (select (let ((.cse9 (store .cse5 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12568))) (store .cse9 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select .cse9 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 v_ArrVal_12571) .cse4 v_ArrVal_12574))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))))) is different from false [2024-10-26 03:29:49,187 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse6 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse10 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse1 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 1)) (.cse2 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 2)) (.cse3 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 3)) (.cse4 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 4)) (.cse5 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse8 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse6 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse10 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_12568 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_12574 Int) (v_ArrVal_12571 Int)) (= (select (select (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12568))) (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 v_ArrVal_12571) .cse4 v_ArrVal_12574))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_12568 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_12574 Int) (v_ArrVal_12571 Int)) (= (select (select (let ((.cse7 (store .cse5 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12568))) (store .cse7 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select .cse7 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 v_ArrVal_12571) .cse4 v_ArrVal_12574))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse8) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_12568 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_12574 Int) (v_ArrVal_12571 Int)) (= (select (select (let ((.cse9 (store .cse5 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12568))) (store .cse9 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select .cse9 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 v_ArrVal_12571) .cse4 v_ArrVal_12574))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse10) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_12568 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_12574 Int) (v_ArrVal_12571 Int)) (= (select (select (let ((.cse11 (store .cse5 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12568))) (store .cse11 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select .cse11 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 v_ArrVal_12571) .cse4 v_ArrVal_12574))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))))) is different from false [2024-10-26 03:29:49,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:29:49,212 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 90 treesize of output 81 [2024-10-26 03:29:49,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:29:49,220 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 310 treesize of output 282 [2024-10-26 03:29:49,226 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 10995 treesize of output 10859 [2024-10-26 03:29:49,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:29:49,312 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 2752 treesize of output 2184 [2024-10-26 03:29:49,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:29:49,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 81 [2024-10-26 03:29:49,371 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:29:49,379 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:29:49,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 144 treesize of output 130 [2024-10-26 03:29:49,388 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 674 treesize of output 666 [2024-10-26 03:29:49,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 459 treesize of output 355 [2024-10-26 03:29:49,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:29:49,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 81 [2024-10-26 03:29:49,457 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:29:49,465 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:29:49,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 144 treesize of output 130 [2024-10-26 03:29:49,475 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 674 treesize of output 666 [2024-10-26 03:29:49,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 787 treesize of output 623 [2024-10-26 03:29:49,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:29:49,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 81 [2024-10-26 03:29:49,551 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:29:49,560 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:29:49,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 176 treesize of output 154 [2024-10-26 03:29:49,570 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 2670 treesize of output 2638 [2024-10-26 03:29:49,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 2759 treesize of output 2171 [2024-10-26 03:29:57,020 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 11 trivial. 2 not checked. [2024-10-26 03:29:57,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573974305] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:29:57,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:29:57,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 21] total 61 [2024-10-26 03:29:57,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748807935] [2024-10-26 03:29:57,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:29:57,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-10-26 03:29:57,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:29:57,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-10-26 03:29:57,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=3131, Unknown=38, NotChecked=348, Total=3782 [2024-10-26 03:29:57,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:29:57,023 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:29:57,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 8.62295081967213) internal successors, (526), 62 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:29:57,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:57,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:57,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:29:57,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:57,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:57,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:57,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:29:57,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:29:57,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:29:57,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:29:57,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:29:57,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:29:57,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:29:57,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:29:57,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:29:57,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:29:57,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:29:57,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:29:57,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:29:57,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:29:57,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:29:57,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-10-26 03:29:57,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:29:57,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-10-26 03:29:57,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-10-26 03:29:57,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-26 03:29:57,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:29:57,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-10-26 03:29:57,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:30:06,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:30:08,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:30:10,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:30:12,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:30:15,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:30:17,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:30:19,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:30:21,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:30:23,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:30:25,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:30:27,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:30:29,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:30:31,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:30:34,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:30:37,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:30:39,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:30:42,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:30:44,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:30:47,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:30:50,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:30:52,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-26 03:30:53,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:30:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:30:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:30:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:30:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:30:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:30:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:30:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:30:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:30:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:30:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:30:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:30:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:30:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:30:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:30:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:30:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:30:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:30:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:30:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:30:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:30:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-10-26 03:30:53,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:30:53,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-26 03:30:53,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-26 03:30:53,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-26 03:30:53,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:30:53,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-26 03:30:53,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-26 03:30:53,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2024-10-26 03:30:53,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,38 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:30:53,866 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t1_funErr4ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:30:53,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:30:53,866 INFO L85 PathProgramCache]: Analyzing trace with hash 2110066100, now seen corresponding path program 1 times [2024-10-26 03:30:53,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:30:53,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61589282] [2024-10-26 03:30:53,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:30:53,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:30:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:30:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:30:54,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:30:54,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61589282] [2024-10-26 03:30:54,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61589282] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:30:54,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939713923] [2024-10-26 03:30:54,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:30:54,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:30:54,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:30:54,358 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:30:54,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-10-26 03:30:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:30:54,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-26 03:30:54,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:30:55,216 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-26 03:30:55,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 03:30:55,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:30:55,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 03:30:55,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:30:55,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 03:30:55,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:30:55,407 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 45 treesize of output 34 [2024-10-26 03:30:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:30:55,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:30:57,556 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_12828 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12828) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) 0)) (forall ((v_ArrVal_12828 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12828) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) 0)) (forall ((v_ArrVal_12828 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12828) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) 0)) (forall ((v_ArrVal_12828 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12828) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) 0))))) is different from false [2024-10-26 03:30:57,568 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse1 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_12828 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12828) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) 0)) (forall ((v_ArrVal_12828 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12828) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) 0)) (forall ((v_ArrVal_12828 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12828) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) 0)) (forall ((v_ArrVal_12828 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12828) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) 0))))) is different from false [2024-10-26 03:30:57,581 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse3 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse1 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_12828 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12828) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) 0)) (forall ((v_ArrVal_12828 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12828) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) 0)) (forall ((v_ArrVal_12828 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12828) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) 0)) (forall ((v_ArrVal_12828 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_12828) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse3) 0))))) is different from false [2024-10-26 03:30:57,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:30:57,592 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 37 treesize of output 53 [2024-10-26 03:30:57,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:30:57,595 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 66 treesize of output 36 [2024-10-26 03:30:57,606 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:30:57,607 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:30:57,612 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:30:57,612 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:30:57,617 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:30:57,617 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:30:57,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:30:57,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939713923] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:30:57,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:30:57,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2024-10-26 03:30:57,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056958263] [2024-10-26 03:30:57,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:30:57,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-26 03:30:57,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:30:57,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-26 03:30:57,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=752, Unknown=14, NotChecked=174, Total=1056 [2024-10-26 03:30:57,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:30:57,935 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:30:57,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 11.15625) internal successors, (357), 33 states have internal predecessors, (357), 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) [2024-10-26 03:30:57,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:30:57,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:30:57,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:30:57,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:30:57,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:30:57,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:30:57,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:30:57,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:30:57,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:30:57,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:30:57,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:30:57,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:30:57,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:30:57,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:30:57,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:30:57,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:30:57,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:30:57,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:30:57,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:30:57,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:30:57,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:30:57,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-10-26 03:30:57,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:30:57,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-10-26 03:30:57,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-10-26 03:30:57,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-26 03:30:57,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:30:57,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2024-10-26 03:30:57,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-10-26 03:30:57,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:31:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:31:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:31:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:31:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:31:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:31:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:31:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:31:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:31:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:31:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:31:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:31:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:31:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:31:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:31:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:31:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-10-26 03:31:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:31:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-26 03:31:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-26 03:31:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-26 03:31:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:31:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-26 03:31:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-26 03:31:02,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:31:02,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2024-10-26 03:31:02,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2024-10-26 03:31:02,873 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting t1_funErr4ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-26 03:31:02,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:31:02,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1395638742, now seen corresponding path program 1 times [2024-10-26 03:31:02,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:31:02,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943666584] [2024-10-26 03:31:02,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:31:02,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:31:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:31:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:31:04,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:31:04,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943666584] [2024-10-26 03:31:04,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943666584] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:31:04,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726420060] [2024-10-26 03:31:04,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:31:04,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:31:04,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:31:04,275 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:31:04,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-10-26 03:31:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:31:04,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-10-26 03:31:04,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:31:04,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-26 03:31:05,258 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 03:31:05,259 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 [2024-10-26 03:31:05,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:31:05,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-26 03:31:05,477 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-26 03:31:05,478 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 [2024-10-26 03:31:05,774 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-26 03:31:05,812 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 23 treesize of output 22 [2024-10-26 03:31:05,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 03:31:05,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 03:31:06,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:31:06,053 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 45 treesize of output 34 [2024-10-26 03:31:06,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:31:06,067 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 45 treesize of output 34 [2024-10-26 03:31:06,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:31:06,087 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 45 treesize of output 34 [2024-10-26 03:31:06,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:31:06,100 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 45 treesize of output 34 [2024-10-26 03:31:06,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:31:06,245 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 45 treesize of output 34 [2024-10-26 03:31:06,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:31:06,262 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 45 treesize of output 34 [2024-10-26 03:31:06,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:31:06,281 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 45 treesize of output 34 [2024-10-26 03:31:06,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:31:06,296 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 45 treesize of output 34 [2024-10-26 03:31:06,385 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:31:06,386 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 11 treesize of output 11 [2024-10-26 03:31:06,656 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 52 treesize of output 49 [2024-10-26 03:31:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:31:06,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:31:15,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:31:15,561 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 73 treesize of output 64 [2024-10-26 03:31:15,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:31:15,569 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 186 treesize of output 178 [2024-10-26 03:31:15,576 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 141 treesize of output 125 [2024-10-26 03:31:15,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-26 03:31:15,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 94 [2024-10-26 03:31:15,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:31:15,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 64 [2024-10-26 03:31:15,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:31:15,710 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 186 treesize of output 178 [2024-10-26 03:31:15,718 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 141 treesize of output 125 [2024-10-26 03:31:15,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-26 03:31:15,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 94 [2024-10-26 03:31:15,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:31:15,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 64 [2024-10-26 03:31:15,828 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-26 03:31:15,828 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 186 treesize of output 173 [2024-10-26 03:31:15,833 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 26 [2024-10-26 03:31:15,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-26 03:31:15,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:31:15,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 64 [2024-10-26 03:31:15,866 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-26 03:31:15,866 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 186 treesize of output 173 [2024-10-26 03:31:15,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-26 03:31:15,874 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 26 [2024-10-26 03:31:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:31:17,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726420060] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:31:17,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:31:17,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 20] total 54 [2024-10-26 03:31:17,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997528582] [2024-10-26 03:31:17,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:31:17,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-26 03:31:17,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:31:17,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-26 03:31:17,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=2716, Unknown=18, NotChecked=0, Total=2970 [2024-10-26 03:31:17,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:31:17,615 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:31:17,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 8.796296296296296) internal successors, (475), 55 states have internal predecessors, (475), 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) [2024-10-26 03:31:17,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:17,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:17,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:31:17,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:17,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:17,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:17,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:31:17,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:17,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:31:17,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:31:17,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:31:17,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-26 03:31:17,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-26 03:31:17,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 03:31:17,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:31:17,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:31:17,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:31:17,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:31:17,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:31:17,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:31:17,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:31:17,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-10-26 03:31:17,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:31:17,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-10-26 03:31:17,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-10-26 03:31:17,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-26 03:31:17,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:31:17,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2024-10-26 03:31:17,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-10-26 03:31:17,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:31:17,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Killed by 15