./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-index-inc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 6568ba33 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-index-inc.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 2c4a731d968c8b3136fe56f501bb6493c1ca96e59709a347334934436fe70eb7 --- Real Ultimate output --- This is Ultimate 0.2.3-?-6568ba3-m [2023-11-24 02:23:23,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 02:23:23,374 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-24 02:23:23,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 02:23:23,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 02:23:23,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 02:23:23,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 02:23:23,402 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 02:23:23,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 02:23:23,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 02:23:23,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 02:23:23,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 02:23:23,407 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 02:23:23,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 02:23:23,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 02:23:23,409 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 02:23:23,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 02:23:23,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 02:23:23,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 02:23:23,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 02:23:23,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 02:23:23,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 02:23:23,411 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-24 02:23:23,412 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 02:23:23,412 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 02:23:23,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 02:23:23,412 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 02:23:23,413 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 02:23:23,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 02:23:23,413 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-24 02:23:23,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 02:23:23,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 02:23:23,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 02:23:23,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 02:23:23,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 02:23:23,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 02:23:23,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 02:23:23,415 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 02:23:23,415 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-24 02:23:23,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-24 02:23:23,416 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 02:23:23,416 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-24 02:23:23,416 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-24 02:23:23,417 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 -> 2c4a731d968c8b3136fe56f501bb6493c1ca96e59709a347334934436fe70eb7 [2023-11-24 02:23:23,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 02:23:23,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 02:23:23,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 02:23:23,635 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 02:23:23,635 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 02:23:23,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-index-inc.i [2023-11-24 02:23:24,675 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 02:23:24,916 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 02:23:24,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-index-inc.i [2023-11-24 02:23:24,939 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/eea7c18f9/04b356a21f9a471d9952c7806e8c5798/FLAGb78941a4c [2023-11-24 02:23:24,953 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/eea7c18f9/04b356a21f9a471d9952c7806e8c5798 [2023-11-24 02:23:24,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 02:23:24,956 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 02:23:24,957 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 02:23:24,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 02:23:24,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 02:23:24,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 02:23:24" (1/1) ... [2023-11-24 02:23:24,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3425ae0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:23:24, skipping insertion in model container [2023-11-24 02:23:24,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 02:23:24" (1/1) ... [2023-11-24 02:23:25,009 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 02:23:25,358 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 02:23:25,396 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 02:23:25,452 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 02:23:25,506 INFO L206 MainTranslator]: Completed translation [2023-11-24 02:23:25,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:23:25 WrapperNode [2023-11-24 02:23:25,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 02:23:25,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 02:23:25,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 02:23:25,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 02:23:25,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:23:25" (1/1) ... [2023-11-24 02:23:25,540 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:23:25" (1/1) ... [2023-11-24 02:23:25,573 INFO L138 Inliner]: procedures = 281, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2023-11-24 02:23:25,574 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 02:23:25,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 02:23:25,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 02:23:25,575 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 02:23:25,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:23:25" (1/1) ... [2023-11-24 02:23:25,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:23:25" (1/1) ... [2023-11-24 02:23:25,595 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:23:25" (1/1) ... [2023-11-24 02:23:25,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:23:25" (1/1) ... [2023-11-24 02:23:25,602 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:23:25" (1/1) ... [2023-11-24 02:23:25,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:23:25" (1/1) ... [2023-11-24 02:23:25,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:23:25" (1/1) ... [2023-11-24 02:23:25,614 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:23:25" (1/1) ... [2023-11-24 02:23:25,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 02:23:25,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 02:23:25,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 02:23:25,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 02:23:25,622 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:23:25" (1/1) ... [2023-11-24 02:23:25,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 02:23:25,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:23:25,671 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 02:23:25,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 02:23:25,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 02:23:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-24 02:23:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 02:23:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-24 02:23:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-24 02:23:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 02:23:25,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 02:23:25,711 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-24 02:23:25,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 02:23:25,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 02:23:25,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-24 02:23:25,712 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-24 02:23:25,713 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-24 02:23:25,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 02:23:25,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 02:23:25,714 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 02:23:25,854 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 02:23:25,856 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 02:23:26,119 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 02:23:26,139 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 02:23:26,139 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-24 02:23:26,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:23:26 BoogieIcfgContainer [2023-11-24 02:23:26,141 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 02:23:26,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 02:23:26,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 02:23:26,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 02:23:26,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 02:23:24" (1/3) ... [2023-11-24 02:23:26,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c74679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 02:23:26, skipping insertion in model container [2023-11-24 02:23:26,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:23:25" (2/3) ... [2023-11-24 02:23:26,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c74679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 02:23:26, skipping insertion in model container [2023-11-24 02:23:26,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:23:26" (3/3) ... [2023-11-24 02:23:26,149 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-inc.i [2023-11-24 02:23:26,157 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 02:23:26,164 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 02:23:26,165 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-24 02:23:26,165 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 02:23:26,235 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-24 02:23:26,268 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 02:23:26,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 02:23:26,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:23:26,270 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-24 02:23:26,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-24 02:23:26,302 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 02:23:26,310 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2023-11-24 02:23:26,315 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@239bf8fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 02:23:26,315 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-24 02:23:26,437 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:23:26,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:23:26,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2066601285, now seen corresponding path program 1 times [2023-11-24 02:23:26,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:23:26,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865295200] [2023-11-24 02:23:26,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:23:26,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:23:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:23:26,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:23:26,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:23:26,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865295200] [2023-11-24 02:23:26,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865295200] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:23:26,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 02:23:26,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 02:23:26,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484644892] [2023-11-24 02:23:26,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:23:26,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 02:23:26,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:23:26,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 02:23:26,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 02:23:26,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:26,680 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:23:26,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:23:26,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:26,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:26,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 02:23:26,702 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:23:26,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:23:26,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1742492828, now seen corresponding path program 1 times [2023-11-24 02:23:26,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:23:26,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397878731] [2023-11-24 02:23:26,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:23:26,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:23:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:23:26,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:23:26,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:23:26,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397878731] [2023-11-24 02:23:26,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397878731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:23:26,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 02:23:26,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 02:23:26,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479658474] [2023-11-24 02:23:26,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:23:26,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 02:23:26,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:23:26,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 02:23:26,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 02:23:26,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:26,828 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:23:26,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:23:26,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:26,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:26,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:26,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 02:23:26,882 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:23:26,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:23:26,884 INFO L85 PathProgramCache]: Analyzing trace with hash 9922377, now seen corresponding path program 1 times [2023-11-24 02:23:26,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:23:26,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454313227] [2023-11-24 02:23:26,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:23:26,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:23:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:23:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:23:26,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:23:26,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454313227] [2023-11-24 02:23:26,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454313227] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:23:26,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 02:23:26,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 02:23:26,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558420020] [2023-11-24 02:23:26,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:23:26,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 02:23:26,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:23:26,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 02:23:26,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 02:23:26,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:26,971 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:23:26,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:23:26,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:26,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:26,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:27,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:27,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:27,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:27,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 02:23:27,018 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:23:27,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:23:27,019 INFO L85 PathProgramCache]: Analyzing trace with hash 661800941, now seen corresponding path program 1 times [2023-11-24 02:23:27,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:23:27,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771881305] [2023-11-24 02:23:27,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:23:27,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:23:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:23:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:23:27,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:23:27,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771881305] [2023-11-24 02:23:27,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771881305] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:23:27,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 02:23:27,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 02:23:27,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799979584] [2023-11-24 02:23:27,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:23:27,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 02:23:27,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:23:27,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 02:23:27,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 02:23:27,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:27,064 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:23:27,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 33.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:23:27,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:27,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:27,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:27,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:27,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:27,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:27,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:27,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:27,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 02:23:27,147 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:23:27,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:23:27,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2145549144, now seen corresponding path program 1 times [2023-11-24 02:23:27,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:23:27,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780700520] [2023-11-24 02:23:27,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:23:27,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:23:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:23:27,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:23:27,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:23:27,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780700520] [2023-11-24 02:23:27,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780700520] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:23:27,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 02:23:27,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 02:23:27,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212086296] [2023-11-24 02:23:27,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:23:27,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 02:23:27,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:23:27,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 02:23:27,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 02:23:27,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:27,714 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:23:27,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:23:27,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:27,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:27,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:27,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:27,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:27,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:27,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:27,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:27,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:27,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:23:27,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 02:23:27,856 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:23:27,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:23:27,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1185942252, now seen corresponding path program 1 times [2023-11-24 02:23:27,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:23:27,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005624957] [2023-11-24 02:23:27,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:23:27,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:23:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:23:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:23:28,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:23:28,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005624957] [2023-11-24 02:23:28,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005624957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:23:28,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 02:23:28,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-24 02:23:28,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533506952] [2023-11-24 02:23:28,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:23:28,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 02:23:28,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:23:28,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 02:23:28,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-24 02:23:28,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:28,483 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:23:28,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:23:28,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:28,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:28,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:28,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:28,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:23:28,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:28,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:28,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:28,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:28,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:28,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:23:28,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 02:23:28,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 02:23:28,779 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:23:28,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:23:28,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1913256608, now seen corresponding path program 1 times [2023-11-24 02:23:28,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:23:28,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130660837] [2023-11-24 02:23:28,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:23:28,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:23:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:23:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:23:29,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:23:29,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130660837] [2023-11-24 02:23:29,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130660837] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 02:23:29,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861428133] [2023-11-24 02:23:29,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:23:29,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:23:29,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:23:29,560 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 02:23:29,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 02:23:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:23:29,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-24 02:23:29,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 02:23:29,738 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 [2023-11-24 02:23:29,801 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 02:23:29,801 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 15 treesize of output 15 [2023-11-24 02:23:29,959 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 02:23:29,960 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-24 02:23:30,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:30,069 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 26 treesize of output 19 [2023-11-24 02:23:30,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-24 02:23:30,126 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 28 treesize of output 27 [2023-11-24 02:23:30,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:23:30,204 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 40 treesize of output 42 [2023-11-24 02:23:30,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:23:30,255 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 52 treesize of output 57 [2023-11-24 02:23:30,448 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 25 treesize of output 13 [2023-11-24 02:23:30,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:30,500 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 56 treesize of output 45 [2023-11-24 02:23:30,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:30,529 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 56 treesize of output 45 [2023-11-24 02:23:30,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:30,554 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 56 treesize of output 45 [2023-11-24 02:23:30,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:30,575 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 56 treesize of output 45 [2023-11-24 02:23:30,612 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 56 treesize of output 45 [2023-11-24 02:23:30,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:23:30,619 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 02:23:30,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861428133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:23:30,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 02:23:30,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26 [2023-11-24 02:23:30,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577617441] [2023-11-24 02:23:30,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:23:30,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-24 02:23:30,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:23:30,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-24 02:23:30,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2023-11-24 02:23:30,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:30,633 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:23:30,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:23:30,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:30,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:30,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:30,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:30,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:23:30,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-24 02:23:30,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:31,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:31,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:31,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:31,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:31,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:23:31,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 02:23:31,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-24 02:23:31,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 02:23:31,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-24 02:23:31,609 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:23:31,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:23:31,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1456411060, now seen corresponding path program 2 times [2023-11-24 02:23:31,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:23:31,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868264027] [2023-11-24 02:23:31,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:23:31,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:23:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:23:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:23:32,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:23:32,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868264027] [2023-11-24 02:23:32,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868264027] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 02:23:32,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104448876] [2023-11-24 02:23:32,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 02:23:32,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:23:32,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:23:32,254 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) [2023-11-24 02:23:32,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 02:23:32,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 02:23:32,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 02:23:32,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-24 02:23:32,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 02:23:32,481 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 [2023-11-24 02:23:32,563 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 02:23:32,563 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 15 treesize of output 15 [2023-11-24 02:23:32,874 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 02:23:32,874 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-24 02:23:33,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:33,155 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 26 treesize of output 19 [2023-11-24 02:23:33,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 02:23:33,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-24 02:23:33,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-24 02:23:33,642 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 25 treesize of output 13 [2023-11-24 02:23:33,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:33,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-24 02:23:33,713 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 [2023-11-24 02:23:33,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:33,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 02:23:33,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:33,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 02:23:33,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:33,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 02:23:33,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 02:23:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:23:33,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 02:23:34,180 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet8|)))) (and (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_386) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_386) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_386) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_386) c_~datas~0.base) .cse2))))))) is different from false [2023-11-24 02:23:34,199 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse0 (+ c_~datas~0.offset 3 .cse1))) (and (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_380) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_386) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_380) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_386) c_~datas~0.base) .cse0))) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_380) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_386) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_380) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_386) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of1ForFork0_#t~nondet8|))))) is different from false [2023-11-24 02:23:34,213 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse0 (+ c_~datas~0.offset 3 .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_380) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) .cse1 v_ArrVal_386) c_~datas~0.base) .cse0))) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_380) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) .cse1 v_ArrVal_386) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)))) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_380) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) .cse1 v_ArrVal_386) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_380) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) .cse1 v_ArrVal_386) c_~datas~0.base) (+ c_~datas~0.offset .cse2))))))) is different from false [2023-11-24 02:23:34,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 24 [2023-11-24 02:23:34,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-11-24 02:23:34,710 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:23:34,710 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:23:34,714 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-24 02:23:34,715 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 3 case distinctions, treesize of input 43 treesize of output 1 [2023-11-24 02:23:34,716 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:23:34,717 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:23:34,721 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-24 02:23:34,721 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 3 case distinctions, treesize of input 42 treesize of output 1 [2023-11-24 02:23:34,723 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:23:34,723 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:23:34,727 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-24 02:23:34,727 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 3 case distinctions, treesize of input 43 treesize of output 1 [2023-11-24 02:23:35,213 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 92 treesize of output 64 [2023-11-24 02:23:35,223 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 30 [2023-11-24 02:23:35,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:23:35,304 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 35 treesize of output 40 [2023-11-24 02:23:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:23:35,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104448876] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 02:23:35,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 02:23:35,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 18] total 51 [2023-11-24 02:23:35,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739080253] [2023-11-24 02:23:35,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 02:23:35,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-24 02:23:35,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:23:35,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-24 02:23:35,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2061, Unknown=50, NotChecked=288, Total=2652 [2023-11-24 02:23:35,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:35,348 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:23:35,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 4.9411764705882355) internal successors, (252), 52 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:23:35,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:35,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:35,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:35,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:35,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:23:35,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-24 02:23:35,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-24 02:23:35,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:38,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:38,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:38,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:38,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:38,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:23:38,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 02:23:38,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-24 02:23:38,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-24 02:23:38,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 02:23:38,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:23:38,396 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:23:38,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:23:38,397 INFO L85 PathProgramCache]: Analyzing trace with hash 560731744, now seen corresponding path program 3 times [2023-11-24 02:23:38,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:23:38,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500921941] [2023-11-24 02:23:38,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:23:38,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:23:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:23:39,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:23:39,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:23:39,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500921941] [2023-11-24 02:23:39,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500921941] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 02:23:39,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373797132] [2023-11-24 02:23:39,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-24 02:23:39,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:23:39,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:23:39,013 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 02:23:39,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 02:23:39,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-24 02:23:39,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 02:23:39,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-24 02:23:39,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 02:23:39,302 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 [2023-11-24 02:23:39,401 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 02:23:39,402 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 15 treesize of output 15 [2023-11-24 02:23:39,769 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 02:23:39,770 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-24 02:23:39,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:39,777 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 24 treesize of output 11 [2023-11-24 02:23:40,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:40,172 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 [2023-11-24 02:23:40,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:40,177 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 26 treesize of output 19 [2023-11-24 02:23:40,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 02:23:40,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-24 02:23:40,582 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 7 treesize of output 3 [2023-11-24 02:23:40,593 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 25 treesize of output 13 [2023-11-24 02:23:40,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:40,653 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 23 treesize of output 16 [2023-11-24 02:23:40,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-24 02:23:40,751 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 [2023-11-24 02:23:40,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:40,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 02:23:40,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:40,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 02:23:40,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:40,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 02:23:40,941 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 44 treesize of output 41 [2023-11-24 02:23:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:23:40,975 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 02:23:41,388 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse3 (+ c_~datas~0.offset 3 .cse5))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem18#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|)))) (and (forall ((v_ArrVal_497 Int) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) .cse3))) (forall ((v_ArrVal_497 Int) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse5)))) (forall ((v_ArrVal_497 Int) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) (+ c_~datas~0.offset .cse5 1)))) (forall ((v_ArrVal_497 Int) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse7 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) (+ c_~datas~0.offset .cse5)))))))) is different from false [2023-11-24 02:23:41,405 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse5 (+ c_~datas~0.offset 2 .cse3)) (.cse7 (+ c_~datas~0.offset 3 .cse3))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem18#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse5 |c_threadThread1of1ForFork0_#t~nondet8|) .cse7 |c_threadThread1of1ForFork0_#t~nondet8|)))) (and (forall ((v_ArrVal_497 Int) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) (+ c_~datas~0.offset .cse3 1)))) (forall ((v_ArrVal_497 Int) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) .cse5))) (forall ((v_ArrVal_497 Int) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) .cse7))) (forall ((v_ArrVal_497 Int) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse8 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) (+ c_~datas~0.offset .cse3)))))))) is different from false [2023-11-24 02:23:41,427 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem18#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (+ c_~datas~0.offset 2 .cse5)) (.cse3 (+ c_~datas~0.offset 3 .cse5))) (and (forall ((v_ArrVal_497 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse0 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_490) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet8|) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) .cse2))) (forall ((v_ArrVal_497 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse4 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_490) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet8|) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) (+ c_~datas~0.offset .cse5 1)))) (forall ((v_ArrVal_497 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_490) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet8|) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) (+ c_~datas~0.offset .cse5)) |c_threadThread1of1ForFork0_#t~nondet8|)) (forall ((v_ArrVal_497 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse7 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_490) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet8|) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse7 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) .cse3)))))) is different from false [2023-11-24 02:23:41,468 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_~datas~0.offset 2 .cse6)) (.cse4 (+ c_~datas~0.offset 3 .cse6))) (and (forall ((v_ArrVal_497 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse0 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_490) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_497))) c_~datas~0.base) .cse3))) (forall ((v_ArrVal_497 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse5 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_490) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 v_ArrVal_497))) c_~datas~0.base) (+ c_~datas~0.offset .cse6 1)))) (forall ((v_ArrVal_497 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse7 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_490) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 v_ArrVal_497))) c_~datas~0.base) .cse4))) (forall ((v_ArrVal_497 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_490) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse8 .cse1 (store (select .cse8 .cse1) .cse2 v_ArrVal_497))) c_~datas~0.base) (+ c_~datas~0.offset .cse6)) |c_threadThread1of1ForFork0_#t~nondet8|))))) is different from false [2023-11-24 02:23:42,234 INFO L349 Elim1Store]: treesize reduction 33, result has 61.6 percent of original size [2023-11-24 02:23:42,234 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 677 treesize of output 637 [2023-11-24 02:23:42,246 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 370 treesize of output 342 [2023-11-24 02:23:42,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:23:42,259 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 534 treesize of output 494 [2023-11-24 02:23:42,374 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:23:42,389 INFO L349 Elim1Store]: treesize reduction 56, result has 34.9 percent of original size [2023-11-24 02:23:42,389 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 237 treesize of output 240 [2023-11-24 02:23:42,393 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:23:42,397 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 129 [2023-11-24 02:23:42,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:42,415 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:23:42,431 INFO L349 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2023-11-24 02:23:42,432 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 300 [2023-11-24 02:23:42,442 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 150 treesize of output 143 [2023-11-24 02:23:42,445 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:23:42,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 170 [2023-11-24 02:23:42,464 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:23:42,481 INFO L349 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2023-11-24 02:23:42,481 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 373 treesize of output 292 [2023-11-24 02:23:42,489 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 146 treesize of output 140 [2023-11-24 02:23:42,492 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:23:42,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 218 [2023-11-24 02:23:44,126 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 376 treesize of output 260 [2023-11-24 02:23:44,135 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 314 treesize of output 294 [2023-11-24 02:23:44,144 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 30 [2023-11-24 02:23:44,158 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 [2023-11-24 02:23:44,162 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 30 [2023-11-24 02:23:44,175 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 [2023-11-24 02:23:44,189 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 30 [2023-11-24 02:23:44,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-11-24 02:23:44,207 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 [2023-11-24 02:23:44,216 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 30 [2023-11-24 02:23:44,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:23:44,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 92 treesize of output 163 [2023-11-24 02:23:44,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:23:44,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373797132] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 02:23:44,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 02:23:44,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 19] total 52 [2023-11-24 02:23:44,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123071009] [2023-11-24 02:23:44,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 02:23:44,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-24 02:23:44,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:23:44,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-24 02:23:44,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=2092, Unknown=27, NotChecked=388, Total=2756 [2023-11-24 02:23:44,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:44,627 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:23:44,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 4.846153846153846) internal successors, (252), 53 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:23:44,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:44,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:44,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:44,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:44,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:23:44,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-24 02:23:44,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-24 02:23:44,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-11-24 02:23:44,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:49,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:49,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:49,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:49,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:49,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:23:49,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-24 02:23:49,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 02:23:49,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-24 02:23:49,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-24 02:23:49,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-24 02:23:49,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:23:49,336 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:23:49,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:23:49,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1017901236, now seen corresponding path program 4 times [2023-11-24 02:23:49,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:23:49,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172870935] [2023-11-24 02:23:49,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:23:49,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:23:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:23:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:23:49,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:23:49,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172870935] [2023-11-24 02:23:49,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172870935] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 02:23:49,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148232302] [2023-11-24 02:23:49,923 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-24 02:23:49,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:23:49,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:23:49,924 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 02:23:49,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 02:23:50,078 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-24 02:23:50,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 02:23:50,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-24 02:23:50,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 02:23:50,134 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 [2023-11-24 02:23:50,224 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 02:23:50,224 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 15 treesize of output 15 [2023-11-24 02:23:50,519 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 02:23:50,519 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-24 02:23:50,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:50,527 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 24 treesize of output 11 [2023-11-24 02:23:50,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:50,818 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 26 treesize of output 19 [2023-11-24 02:23:50,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:50,826 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 16 treesize of output 11 [2023-11-24 02:23:50,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 02:23:51,069 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 7 treesize of output 3 [2023-11-24 02:23:51,078 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 25 treesize of output 13 [2023-11-24 02:23:51,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:51,123 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 16 treesize of output 11 [2023-11-24 02:23:51,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-24 02:23:51,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-24 02:23:51,262 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 [2023-11-24 02:23:51,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:51,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 02:23:51,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:51,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 02:23:51,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:51,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 02:23:51,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2023-11-24 02:23:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:23:51,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 02:23:52,599 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse3 (+ c_~datas~0.offset 2 .cse5)) (.cse8 (+ c_~datas~0.offset 3 .cse5))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem18#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse8 |c_threadThread1of1ForFork0_#t~nondet8|)))) (and (forall ((v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) .cse3))) (forall ((v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse5 1)))) (forall ((v_ArrVal_609 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse5)) |c_threadThread1of1ForFork0_#t~nondet8|)) (forall ((v_ArrVal_609 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse7 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) .cse8) |c_threadThread1of1ForFork0_#t~nondet8|)))))) is different from false [2023-11-24 02:23:52,618 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse9 (+ c_~datas~0.offset .cse7 1)) (.cse3 (+ c_~datas~0.offset 2 .cse7)) (.cse5 (+ c_~datas~0.offset 3 .cse7))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem18#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse9 |c_threadThread1of1ForFork0_#t~nondet8|) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse5 |c_threadThread1of1ForFork0_#t~nondet8|)))) (and (forall ((v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) .cse3))) (forall ((v_ArrVal_609 (Array Int Int))) (= (select (select (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) .cse5) |c_threadThread1of1ForFork0_#t~nondet8|)) (forall ((v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse7)))) (forall ((v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse8 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) .cse9))))))) is different from false [2023-11-24 02:23:52,677 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem18#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (+ c_~datas~0.offset .cse5 1)) (.cse3 (+ c_~datas~0.offset 2 .cse5)) (.cse4 (+ c_~datas~0.offset 3 .cse5))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse0 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet8|) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse5)))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse6 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet8|) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) .cse2))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet8|) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse7 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet8|)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse8 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet8|) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse8 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) .cse4)))))) is different from false [2023-11-24 02:23:52,724 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse4 (+ c_~datas~0.offset 2 .cse8)) (.cse5 (+ c_~datas~0.offset 3 .cse8)) (.cse3 (+ c_~datas~0.offset .cse8 1))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|) .cse5 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0))) c_~datas~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet8|)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse6 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|) .cse5 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 0))) c_~datas~0.base) .cse5))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse7 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|) .cse5 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse8)))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse9 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|) .cse5 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 0))) c_~datas~0.base) .cse3)))))) is different from false [2023-11-24 02:23:52,776 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ c_~datas~0.offset .cse7 1)) (.cse4 (+ c_~datas~0.offset 2 .cse7)) (.cse5 (+ c_~datas~0.offset 3 .cse7))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|) .cse5 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0))) c_~datas~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet8|)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|) .cse5 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse7)) |c_threadThread1of1ForFork0_#t~nondet8|)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|) .cse5 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse8 .cse1 (store (select .cse8 .cse1) .cse2 0))) c_~datas~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet8|)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse9 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|) .cse5 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 0))) c_~datas~0.base) .cse5)))))) is different from false [2023-11-24 02:23:52,958 INFO L349 Elim1Store]: treesize reduction 25, result has 64.3 percent of original size [2023-11-24 02:23:52,959 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 780 treesize of output 752 [2023-11-24 02:23:52,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:23:52,973 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 526 treesize of output 484 [2023-11-24 02:23:52,978 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 352 treesize of output 324 [2023-11-24 02:23:53,049 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:23:53,062 INFO L349 Elim1Store]: treesize reduction 52, result has 25.7 percent of original size [2023-11-24 02:23:53,062 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 237 treesize of output 236 [2023-11-24 02:23:53,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:53,069 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:23:53,070 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 125 treesize of output 109 [2023-11-24 02:23:53,094 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:23:53,108 INFO L349 Elim1Store]: treesize reduction 52, result has 25.7 percent of original size [2023-11-24 02:23:53,109 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 341 treesize of output 292 [2023-11-24 02:23:53,115 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 157 treesize of output 151 [2023-11-24 02:23:53,117 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:23:53,118 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 178 treesize of output 160 [2023-11-24 02:23:53,133 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:23:53,146 INFO L349 Elim1Store]: treesize reduction 52, result has 25.7 percent of original size [2023-11-24 02:23:53,146 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 237 treesize of output 236 [2023-11-24 02:23:53,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:53,155 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:23:53,157 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 125 treesize of output 109 [2023-11-24 02:23:54,414 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 376 treesize of output 260 [2023-11-24 02:23:54,422 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 314 treesize of output 294 [2023-11-24 02:23:54,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-11-24 02:23:54,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 34 treesize of output 30 [2023-11-24 02:23:54,448 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 [2023-11-24 02:23:54,456 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 30 [2023-11-24 02:23:54,470 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 30 [2023-11-24 02:23:54,484 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 [2023-11-24 02:23:54,490 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 30 [2023-11-24 02:23:54,507 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 [2023-11-24 02:23:54,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:23:54,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 92 treesize of output 163 [2023-11-24 02:23:54,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-24 02:23:54,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148232302] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 02:23:54,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 02:23:54,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 18] total 47 [2023-11-24 02:23:54,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848757063] [2023-11-24 02:23:54,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 02:23:54,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-24 02:23:54,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:23:54,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-24 02:23:54,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1583, Unknown=39, NotChecked=430, Total=2256 [2023-11-24 02:23:54,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:54,824 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:23:54,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 5.361702127659575) internal successors, (252), 48 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:23:54,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:54,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:54,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:54,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:54,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:23:54,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-11-24 02:23:54,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 02:23:54,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-24 02:23:54,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-24 02:23:54,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:57,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:23:57,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:57,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:57,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:23:57,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:23:57,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 02:23:57,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 02:23:57,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-24 02:23:57,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-24 02:23:57,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-24 02:23:57,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-24 02:23:58,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-24 02:23:58,197 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:23:58,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:23:58,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1052002144, now seen corresponding path program 5 times [2023-11-24 02:23:58,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:23:58,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551364094] [2023-11-24 02:23:58,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:23:58,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:23:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:23:58,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:23:58,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:23:58,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551364094] [2023-11-24 02:23:58,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551364094] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 02:23:58,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379210854] [2023-11-24 02:23:58,823 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-24 02:23:58,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:23:58,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:23:58,824 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 02:23:58,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-24 02:23:58,936 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 02:23:58,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 02:23:58,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-24 02:23:58,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 02:23:59,070 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 [2023-11-24 02:23:59,164 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 02:23:59,165 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 15 treesize of output 15 [2023-11-24 02:23:59,425 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 7 treesize of output 3 [2023-11-24 02:23:59,531 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 02:23:59,531 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-24 02:23:59,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:23:59,796 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 26 treesize of output 19 [2023-11-24 02:23:59,909 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 25 treesize of output 13 [2023-11-24 02:23:59,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 02:23:59,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-24 02:24:00,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-24 02:24:00,090 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 [2023-11-24 02:24:00,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:00,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 02:24:00,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:00,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 02:24:00,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:00,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 02:24:00,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 02:24:00,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:24:00,304 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 02:24:00,318 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_threadThread1of1ForFork0_~j~0 4))) (and (forall ((v_ArrVal_719 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))) (forall ((v_ArrVal_719 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (forall ((v_ArrVal_719 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))) (forall ((v_ArrVal_719 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of1ForFork0_#t~nondet8|)))) is different from false [2023-11-24 02:24:00,448 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet8|)))) (and (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet8|)) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))))))) is different from false [2023-11-24 02:24:00,577 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse3 (+ c_~datas~0.offset .cse2 1)) (.cse1 (+ c_~datas~0.offset 2 .cse2)) (.cse4 (+ c_~datas~0.offset 3 .cse2))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse1 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|)))) (and (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) .cse1))) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) (+ c_~datas~0.offset .cse2)))) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) .cse3))) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) .cse4))))))) is different from false [2023-11-24 02:24:00,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:00,589 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 54 treesize of output 70 [2023-11-24 02:24:00,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:00,593 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 167 treesize of output 75 [2023-11-24 02:24:00,599 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 27 [2023-11-24 02:24:00,600 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 48 treesize of output 34 [2023-11-24 02:24:00,613 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-24 02:24:00,613 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 54 treesize of output 1 [2023-11-24 02:24:00,618 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-24 02:24:00,618 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 53 treesize of output 1 [2023-11-24 02:24:00,622 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-24 02:24:00,622 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 54 treesize of output 1 [2023-11-24 02:24:00,985 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 92 treesize of output 64 [2023-11-24 02:24:00,995 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 30 [2023-11-24 02:24:01,016 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 8 treesize of output 4 [2023-11-24 02:24:01,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:01,084 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 35 treesize of output 40 [2023-11-24 02:24:01,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:24:01,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379210854] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 02:24:01,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 02:24:01,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22, 17] total 49 [2023-11-24 02:24:01,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514217909] [2023-11-24 02:24:01,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 02:24:01,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-24 02:24:01,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:24:01,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-24 02:24:01,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1896, Unknown=44, NotChecked=276, Total=2450 [2023-11-24 02:24:01,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:01,133 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:24:01,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 4.387755102040816) internal successors, (215), 50 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:24:01,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:01,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:01,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:01,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:01,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:01,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-24 02:24:01,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 02:24:01,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-11-24 02:24:01,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-11-24 02:24:01,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-24 02:24:01,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:07,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-24 02:24:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-24 02:24:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-24 02:24:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-24 02:24:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-24 02:24:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-24 02:24:07,329 INFO L805 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 5 remaining) [2023-11-24 02:24:07,329 INFO L805 garLoopResultBuilder]: Registering result SAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2023-11-24 02:24:07,330 INFO L805 garLoopResultBuilder]: Registering result SAFE for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2023-11-24 02:24:07,330 INFO L805 garLoopResultBuilder]: Registering result SAFE for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2023-11-24 02:24:07,330 INFO L805 garLoopResultBuilder]: Registering result SAFE for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2023-11-24 02:24:07,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-24 02:24:07,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:24:07,539 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2023-11-24 02:24:07,541 INFO L307 ceAbstractionStarter]: Result for error location threadThread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-11-24 02:24:07,544 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 02:24:07,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 02:24:07,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:24:07,545 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) [2023-11-24 02:24:07,547 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 02:24:07,548 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-24 02:24:07,548 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@239bf8fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 02:24:07,548 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-24 02:24:07,556 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 [2023-11-24 02:24:07,559 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 02:24:07,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:24:07,559 INFO L85 PathProgramCache]: Analyzing trace with hash 663518903, now seen corresponding path program 1 times [2023-11-24 02:24:07,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:24:07,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219204956] [2023-11-24 02:24:07,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:07,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:24:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:24:07,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:24:07,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219204956] [2023-11-24 02:24:07,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219204956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:24:07,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 02:24:07,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 02:24:07,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51160708] [2023-11-24 02:24:07,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:24:07,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 02:24:07,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:24:07,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 02:24:07,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 02:24:07,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:07,569 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:24:07,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:24:07,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:07,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:07,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 02:24:07,570 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 02:24:07,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:24:07,570 INFO L85 PathProgramCache]: Analyzing trace with hash -276997546, now seen corresponding path program 1 times [2023-11-24 02:24:07,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:24:07,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773336342] [2023-11-24 02:24:07,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:07,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:24:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:24:07,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:24:07,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773336342] [2023-11-24 02:24:07,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773336342] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:24:07,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 02:24:07,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 02:24:07,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047758455] [2023-11-24 02:24:07,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:24:07,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 02:24:07,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:24:07,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 02:24:07,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 02:24:07,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:07,591 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:24:07,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:24:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:07,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:07,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:07,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 02:24:07,597 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 02:24:07,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:24:07,598 INFO L85 PathProgramCache]: Analyzing trace with hash 67025839, now seen corresponding path program 1 times [2023-11-24 02:24:07,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:24:07,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854224641] [2023-11-24 02:24:07,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:07,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:24:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:24:07,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:24:07,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854224641] [2023-11-24 02:24:07,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854224641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:24:07,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 02:24:07,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 02:24:07,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276914785] [2023-11-24 02:24:07,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:24:07,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 02:24:07,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:24:07,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 02:24:07,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 02:24:07,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:07,723 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:24:07,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:24:07,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:07,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:07,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:07,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:07,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:07,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:07,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 02:24:07,802 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 02:24:07,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:24:07,802 INFO L85 PathProgramCache]: Analyzing trace with hash -282280213, now seen corresponding path program 1 times [2023-11-24 02:24:07,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:24:07,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217610037] [2023-11-24 02:24:07,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:07,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:24:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 02:24:07,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 02:24:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 02:24:07,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 02:24:07,856 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 02:24:07,856 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-24 02:24:07,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-11-24 02:24:07,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-11-24 02:24:07,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2023-11-24 02:24:07,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-11-24 02:24:07,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-11-24 02:24:07,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-11-24 02:24:07,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 02:24:07,865 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-24 02:24:07,865 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-11-24 02:24:07,866 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-24 02:24:07,866 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-24 02:24:07,889 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-24 02:24:07,894 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 02:24:07,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 02:24:07,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:24:07,897 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-24 02:24:07,902 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 02:24:07,902 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of2ForFork0 ======== [2023-11-24 02:24:07,902 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@239bf8fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 02:24:07,902 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-24 02:24:07,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2023-11-24 02:24:07,971 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:24:07,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:24:07,972 INFO L85 PathProgramCache]: Analyzing trace with hash -559413359, now seen corresponding path program 1 times [2023-11-24 02:24:07,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:24:07,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150600892] [2023-11-24 02:24:07,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:07,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:24:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:07,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:24:07,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:24:07,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150600892] [2023-11-24 02:24:07,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150600892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:24:07,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 02:24:07,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 02:24:07,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873532301] [2023-11-24 02:24:07,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:24:07,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 02:24:07,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:24:07,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 02:24:07,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 02:24:07,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:07,986 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:24:07,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:24:07,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:07,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:07,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 02:24:07,992 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:24:07,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:24:07,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1887141238, now seen corresponding path program 1 times [2023-11-24 02:24:07,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:24:07,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804814233] [2023-11-24 02:24:07,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:07,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:24:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:08,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:24:08,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:24:08,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804814233] [2023-11-24 02:24:08,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804814233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:24:08,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 02:24:08,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 02:24:08,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56214037] [2023-11-24 02:24:08,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:24:08,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 02:24:08,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:24:08,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 02:24:08,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 02:24:08,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:08,013 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:24:08,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:24:08,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:08,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:08,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:08,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:08,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-24 02:24:08,036 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:24:08,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:24:08,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1315591313, now seen corresponding path program 1 times [2023-11-24 02:24:08,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:24:08,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759156291] [2023-11-24 02:24:08,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:08,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:24:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:24:08,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:24:08,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759156291] [2023-11-24 02:24:08,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759156291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:24:08,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 02:24:08,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 02:24:08,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052946781] [2023-11-24 02:24:08,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:24:08,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 02:24:08,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:24:08,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 02:24:08,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 02:24:08,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:08,062 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:24:08,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:24:08,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:08,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:08,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:08,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:08,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:08,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:08,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-24 02:24:08,085 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:24:08,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:24:08,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1840027091, now seen corresponding path program 1 times [2023-11-24 02:24:08,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:24:08,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256252885] [2023-11-24 02:24:08,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:08,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:24:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:08,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:24:08,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:24:08,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256252885] [2023-11-24 02:24:08,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256252885] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:24:08,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 02:24:08,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 02:24:08,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089890717] [2023-11-24 02:24:08,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:24:08,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 02:24:08,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:24:08,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 02:24:08,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 02:24:08,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:08,111 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:24:08,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 33.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:24:08,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:08,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:08,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:08,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:08,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:08,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:08,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:08,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:08,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-24 02:24:08,159 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:24:08,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:24:08,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1432873128, now seen corresponding path program 1 times [2023-11-24 02:24:08,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:24:08,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448224871] [2023-11-24 02:24:08,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:08,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:24:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:08,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:24:08,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:24:08,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448224871] [2023-11-24 02:24:08,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448224871] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:24:08,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 02:24:08,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 02:24:08,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977329970] [2023-11-24 02:24:08,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:24:08,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 02:24:08,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:24:08,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 02:24:08,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 02:24:08,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:08,383 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:24:08,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:24:08,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:08,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:08,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:08,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:08,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:08,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:08,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:08,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:08,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:08,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:08,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-24 02:24:08,630 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:24:08,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:24:08,630 INFO L85 PathProgramCache]: Analyzing trace with hash -658336902, now seen corresponding path program 1 times [2023-11-24 02:24:08,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:24:08,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512125495] [2023-11-24 02:24:08,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:08,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:24:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:24:08,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:24:08,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512125495] [2023-11-24 02:24:08,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512125495] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:24:08,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 02:24:08,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-24 02:24:08,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026978459] [2023-11-24 02:24:08,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:24:08,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 02:24:08,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:24:08,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 02:24:08,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-24 02:24:08,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:08,929 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:24:08,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:24:08,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:08,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:08,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:08,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:08,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:08,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:09,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:09,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:09,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:09,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:09,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:09,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 02:24:09,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-24 02:24:09,239 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:24:09,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:24:09,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1387039532, now seen corresponding path program 1 times [2023-11-24 02:24:09,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:24:09,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151913778] [2023-11-24 02:24:09,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:09,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:24:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:09,514 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-24 02:24:09,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:24:09,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151913778] [2023-11-24 02:24:09,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151913778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:24:09,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 02:24:09,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 02:24:09,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141515484] [2023-11-24 02:24:09,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:24:09,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 02:24:09,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:24:09,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 02:24:09,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 02:24:09,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:09,517 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:24:09,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:24:09,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:09,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:09,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:09,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:09,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:09,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-24 02:24:09,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:09,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:09,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:09,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:09,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:09,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:09,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 02:24:09,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:09,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-24 02:24:09,716 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:24:09,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:24:09,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1956239357, now seen corresponding path program 1 times [2023-11-24 02:24:09,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:24:09,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757946367] [2023-11-24 02:24:09,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:09,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:24:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:10,556 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-24 02:24:10,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:24:10,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757946367] [2023-11-24 02:24:10,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757946367] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 02:24:10,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936735327] [2023-11-24 02:24:10,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:10,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:24:10,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:24:10,572 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 02:24:10,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-24 02:24:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:10,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-24 02:24:10,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 02:24:10,893 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 15 treesize of output 11 [2023-11-24 02:24:10,917 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 28 treesize of output 27 [2023-11-24 02:24:10,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:10,949 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 40 treesize of output 42 [2023-11-24 02:24:10,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:10,988 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 52 treesize of output 57 [2023-11-24 02:24:11,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:11,131 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 56 treesize of output 45 [2023-11-24 02:24:11,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:11,147 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 56 treesize of output 45 [2023-11-24 02:24:11,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:11,163 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 56 treesize of output 45 [2023-11-24 02:24:11,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:11,189 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 56 treesize of output 45 [2023-11-24 02:24:11,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:11,332 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 56 treesize of output 45 [2023-11-24 02:24:11,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:11,344 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 56 treesize of output 45 [2023-11-24 02:24:11,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:11,362 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 56 treesize of output 45 [2023-11-24 02:24:11,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:11,375 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 56 treesize of output 45 [2023-11-24 02:24:11,638 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-24 02:24:11,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 71 treesize of output 60 [2023-11-24 02:24:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-24 02:24:11,644 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 02:24:11,892 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_threadThread1of2ForFork0_~j~0 4))) (and (forall ((v_ArrVal_1188 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1188) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (<= (+ c_threadThread1of2ForFork0_~j~0 1) c_~next_j~0) (forall ((v_ArrVal_1188 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1188) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))) (forall ((v_ArrVal_1188 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1188) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of2ForFork0_#t~nondet8|)) (forall ((v_ArrVal_1188 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1188) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))))) is different from false [2023-11-24 02:24:12,144 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_threadThread1of2ForFork0_~j~0 4))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet8|)))) (and (<= (+ c_threadThread1of2ForFork0_~j~0 1) c_~next_j~0) (forall ((v_ArrVal_1188 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1188) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (forall ((v_ArrVal_1188 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1188) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)) |c_threadThread1of2ForFork0_#t~nondet8|)) (forall ((v_ArrVal_1188 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1188) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_1188 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1188) c_~datas~0.base) .cse2))))))) is different from false [2023-11-24 02:24:12,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:12,306 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 50 treesize of output 66 [2023-11-24 02:24:12,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:12,311 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 113 treesize of output 34 [2023-11-24 02:24:12,320 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-24 02:24:12,320 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 51 treesize of output 1 [2023-11-24 02:24:12,323 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-24 02:24:12,323 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 51 treesize of output 1 [2023-11-24 02:24:12,327 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-24 02:24:12,327 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 51 treesize of output 1 [2023-11-24 02:24:12,501 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 22 not checked. [2023-11-24 02:24:12,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936735327] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 02:24:12,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 02:24:12,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 37 [2023-11-24 02:24:12,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745982212] [2023-11-24 02:24:12,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 02:24:12,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-24 02:24:12,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:24:12,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-24 02:24:12,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1035, Unknown=46, NotChecked=138, Total=1406 [2023-11-24 02:24:12,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:12,503 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:24:12,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 8.324324324324325) internal successors, (308), 38 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:24:12,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:12,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:12,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:12,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:12,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:12,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-24 02:24:12,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:12,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:13,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 02:24:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-24 02:24:13,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-24 02:24:13,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:24:13,981 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:24:13,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:24:13,981 INFO L85 PathProgramCache]: Analyzing trace with hash -178820842, now seen corresponding path program 1 times [2023-11-24 02:24:13,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:24:13,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255361655] [2023-11-24 02:24:13,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:13,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:24:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:24:14,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:24:14,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255361655] [2023-11-24 02:24:14,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255361655] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 02:24:14,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53292412] [2023-11-24 02:24:14,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:14,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:24:14,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:24:14,796 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 02:24:14,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-24 02:24:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:14,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-24 02:24:14,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 02:24:14,954 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 [2023-11-24 02:24:15,012 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 02:24:15,012 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 15 treesize of output 15 [2023-11-24 02:24:15,194 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-24 02:24:15,194 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 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-24 02:24:15,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:15,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 26 treesize of output 19 [2023-11-24 02:24:15,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-24 02:24:15,328 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 28 treesize of output 27 [2023-11-24 02:24:15,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:15,366 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 40 treesize of output 42 [2023-11-24 02:24:15,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:15,409 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 52 treesize of output 57 [2023-11-24 02:24:15,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:15,622 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 56 treesize of output 45 [2023-11-24 02:24:15,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:15,641 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 56 treesize of output 45 [2023-11-24 02:24:15,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:15,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-24 02:24:15,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:15,680 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 56 treesize of output 45 [2023-11-24 02:24:15,736 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 02:24:15,736 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-24 02:24:15,885 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 25 treesize of output 13 [2023-11-24 02:24:15,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:15,938 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 56 treesize of output 45 [2023-11-24 02:24:15,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:15,953 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 56 treesize of output 45 [2023-11-24 02:24:15,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:15,967 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 56 treesize of output 45 [2023-11-24 02:24:15,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:15,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-24 02:24:16,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 56 treesize of output 45 [2023-11-24 02:24:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-24 02:24:16,019 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 02:24:16,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53292412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:24:16,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 02:24:16,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 28 [2023-11-24 02:24:16,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555054255] [2023-11-24 02:24:16,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:24:16,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-24 02:24:16,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:24:16,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-24 02:24:16,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2023-11-24 02:24:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:16,021 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:24:16,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:24:16,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:16,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:16,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:16,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:16,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:16,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-24 02:24:16,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:16,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-24 02:24:16,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:20,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:20,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:20,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:20,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:20,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:20,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 02:24:20,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:20,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-24 02:24:20,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-24 02:24:20,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-24 02:24:20,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-24 02:24:20,371 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:24:20,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:24:20,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1296075347, now seen corresponding path program 1 times [2023-11-24 02:24:20,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:24:20,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905633570] [2023-11-24 02:24:20,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:20,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:24:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-24 02:24:20,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:24:20,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905633570] [2023-11-24 02:24:20,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905633570] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:24:20,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 02:24:20,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 02:24:20,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272323243] [2023-11-24 02:24:20,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:24:20,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 02:24:20,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:24:20,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 02:24:20,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 02:24:20,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:20,638 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:24:20,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:24:20,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:20,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:20,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:20,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:20,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:20,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-24 02:24:20,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:20,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-24 02:24:20,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-24 02:24:20,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:20,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:20,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:20,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:20,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 02:24:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-24 02:24:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-24 02:24:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:20,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-24 02:24:20,801 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:24:20,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:24:20,801 INFO L85 PathProgramCache]: Analyzing trace with hash -2037277932, now seen corresponding path program 1 times [2023-11-24 02:24:20,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:24:20,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055664418] [2023-11-24 02:24:20,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:20,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:24:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:24:22,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:24:22,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055664418] [2023-11-24 02:24:22,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055664418] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 02:24:22,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935969683] [2023-11-24 02:24:22,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:22,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:24:22,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:24:22,208 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 02:24:22,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-24 02:24:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:22,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-24 02:24:22,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 02:24:22,404 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 [2023-11-24 02:24:22,468 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 02:24:22,468 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 15 treesize of output 15 [2023-11-24 02:24:22,613 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-24 02:24:22,613 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 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-24 02:24:22,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:22,806 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 26 treesize of output 19 [2023-11-24 02:24:22,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-24 02:24:22,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 28 treesize of output 27 [2023-11-24 02:24:22,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:22,914 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 40 treesize of output 42 [2023-11-24 02:24:22,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:22,970 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 52 treesize of output 57 [2023-11-24 02:24:23,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:23,249 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 56 treesize of output 45 [2023-11-24 02:24:23,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:23,271 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 56 treesize of output 45 [2023-11-24 02:24:23,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:23,297 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 56 treesize of output 45 [2023-11-24 02:24:23,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:23,317 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 56 treesize of output 45 [2023-11-24 02:24:23,354 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 02:24:23,354 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-24 02:24:23,540 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 25 treesize of output 13 [2023-11-24 02:24:23,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:23,601 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 56 treesize of output 45 [2023-11-24 02:24:23,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:23,619 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 56 treesize of output 45 [2023-11-24 02:24:23,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:23,632 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 56 treesize of output 45 [2023-11-24 02:24:23,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:23,659 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 56 treesize of output 45 [2023-11-24 02:24:23,726 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 56 treesize of output 45 [2023-11-24 02:24:23,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 56 treesize of output 45 [2023-11-24 02:24:23,757 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 56 treesize of output 45 [2023-11-24 02:24:23,770 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 56 treesize of output 45 [2023-11-24 02:24:24,056 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-24 02:24:24,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 71 treesize of output 60 [2023-11-24 02:24:24,063 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-24 02:24:24,063 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 02:24:24,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935969683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:24:24,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 02:24:24,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [22] total 40 [2023-11-24 02:24:24,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143362364] [2023-11-24 02:24:24,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:24:24,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-24 02:24:24,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:24:24,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-24 02:24:24,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1471, Unknown=0, NotChecked=0, Total=1640 [2023-11-24 02:24:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:24,066 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:24:24,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.65) internal successors, (133), 21 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:24:24,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:24,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:24,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:24,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:24,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:24,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-24 02:24:24,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:24,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-24 02:24:24,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-24 02:24:24,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:24,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:25,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:25,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:25,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:25,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:25,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 02:24:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-24 02:24:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-24 02:24:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-24 02:24:25,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-24 02:24:25,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:24:25,675 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:24:25,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:24:25,675 INFO L85 PathProgramCache]: Analyzing trace with hash 2090667868, now seen corresponding path program 1 times [2023-11-24 02:24:25,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:24:25,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176253226] [2023-11-24 02:24:25,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:25,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:24:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:24:26,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:24:26,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176253226] [2023-11-24 02:24:26,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176253226] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 02:24:26,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713886275] [2023-11-24 02:24:26,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:26,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:24:26,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:24:26,905 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 02:24:26,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-24 02:24:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:27,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-24 02:24:27,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 02:24:27,105 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 [2023-11-24 02:24:27,168 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 02:24:27,168 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 15 treesize of output 15 [2023-11-24 02:24:27,324 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 02:24:27,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-24 02:24:27,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:27,520 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 26 treesize of output 19 [2023-11-24 02:24:27,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-24 02:24:27,577 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 28 treesize of output 27 [2023-11-24 02:24:27,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:27,626 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 40 treesize of output 42 [2023-11-24 02:24:27,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:27,679 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 52 treesize of output 57 [2023-11-24 02:24:27,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:27,947 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 56 treesize of output 45 [2023-11-24 02:24:27,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:27,971 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 56 treesize of output 45 [2023-11-24 02:24:27,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:27,989 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 56 treesize of output 45 [2023-11-24 02:24:28,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:28,010 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 56 treesize of output 45 [2023-11-24 02:24:28,049 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-24 02:24:28,050 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 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-24 02:24:28,226 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 25 treesize of output 13 [2023-11-24 02:24:28,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:28,286 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 56 treesize of output 45 [2023-11-24 02:24:28,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:28,300 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 56 treesize of output 45 [2023-11-24 02:24:28,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:28,320 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 56 treesize of output 45 [2023-11-24 02:24:28,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:28,347 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 56 treesize of output 45 [2023-11-24 02:24:28,415 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 56 treesize of output 45 [2023-11-24 02:24:28,428 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 56 treesize of output 45 [2023-11-24 02:24:28,440 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 56 treesize of output 45 [2023-11-24 02:24:28,715 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-24 02:24:28,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 71 treesize of output 60 [2023-11-24 02:24:28,727 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 56 treesize of output 45 [2023-11-24 02:24:28,733 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-24 02:24:28,733 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 02:24:28,748 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_threadThread1of2ForFork0_~j~0 4))) (and (forall ((v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (forall ((v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))) (forall ((v_ArrVal_1775 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of2ForFork0_#t~nondet8|)) (forall ((v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))))) is different from false [2023-11-24 02:24:28,758 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~datas~0.base)) (.cse1 (+ c_~datas~0.offset (* c_threadThread2of2ForFork0_~j~0 4))) (.cse2 (* c_threadThread1of2ForFork0_~j~0 4))) (and (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store .cse0 .cse1 |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)) |c_threadThread1of2ForFork0_#t~nondet8|)) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store .cse0 .cse1 |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)) |c_threadThread1of2ForFork0_#t~nondet8|)) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store (store |c_#race| c_~datas~0.base (store .cse0 .cse1 |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse2)))) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store .cse0 .cse1 |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse2)) |c_threadThread1of2ForFork0_#t~nondet8|)))) is different from false [2023-11-24 02:24:28,930 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~datas~0.base)) (.cse1 (* c_threadThread1of2ForFork0_~j~0 4))) (and (forall ((v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store .cse0 (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of2ForFork0_#t~nondet8|)))) (forall ((v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store .cse0 (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)) |c_threadThread1of2ForFork0_#t~nondet8|)))) (forall ((v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store (store |c_#race| c_~datas~0.base (store .cse0 (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse1)))))) (forall ((v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store .cse0 (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse1)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) is different from false [2023-11-24 02:24:29,041 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_threadThread1of2ForFork0_~j~0 4))) (and (forall ((v_ArrVal_1773 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))))) (forall ((v_ArrVal_1773 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of2ForFork0_#t~nondet8|)))) (forall ((v_ArrVal_1773 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of2ForFork0_#t~nondet8|)))) (forall ((v_ArrVal_1773 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) is different from false [2023-11-24 02:24:29,178 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_threadThread1of2ForFork0_~j~0 4))) (and (forall ((v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse0 c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of2ForFork0_#t~nondet8|)))) (forall ((v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse2 c_~datas~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))))) (forall ((v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse3 c_~datas~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse1)) |c_threadThread1of2ForFork0_#t~nondet8|)))) (forall ((v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse4 c_~datas~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse1)))))))) is different from false [2023-11-24 02:24:29,261 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (* c_threadThread1of2ForFork0_~j~0 4))) (and (forall ((v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse0 c_~datas~0.base (store (select (store .cse0 .cse1 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse1 v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))))) (forall ((v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse3 c_~datas~0.base (store (select (store .cse3 .cse1 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse1 v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse2)) |c_threadThread1of2ForFork0_#t~nondet8|)))) (forall ((v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse4 c_~datas~0.base (store (select (store .cse4 .cse1 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse1 v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse2)) |c_threadThread1of2ForFork0_#t~nondet8|)) (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0))) (forall ((v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse5 c_~datas~0.base (store (select (store .cse5 .cse1 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse1 v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) is different from false [2023-11-24 02:24:29,518 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_threadThread1of2ForFork0_~j~0 4))) (and (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse0 c_~datas~0.base (store (select (store .cse0 .cse1 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse1 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse2)) |c_threadThread1of2ForFork0_#t~nondet8|)))) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse3 c_~datas~0.base (store (select (store .cse3 .cse4 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse4 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset .cse2)) |c_threadThread1of2ForFork0_#t~nondet8|)))) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (let ((.cse6 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse5 c_~datas~0.base (store (select (store .cse5 .cse6 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse6 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))))) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse8 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse7 c_~datas~0.base (store (select (store .cse7 .cse8 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse8 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) is different from false [2023-11-24 02:24:29,666 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (* c_threadThread1of2ForFork0_~j~0 4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse1 c_~datas~0.base (store (select (store .cse1 .cse2 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse2 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse3)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse4 c_~datas~0.base (store (select (store .cse4 .cse5 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse5 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset .cse3 1)))))))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse7 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse6 c_~datas~0.base (store (select (store .cse6 .cse7 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse7 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset .cse3)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (let ((.cse9 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse8 c_~datas~0.base (store (select (store .cse8 .cse9 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse9 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse3)))))))))) is different from false [2023-11-24 02:24:30,009 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_threadThread1of2ForFork0_~j~0 4))) (let ((.cse6 (+ c_~datas~0.offset 3 .cse3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet8|)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse2 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse2 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse3)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse4 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse4 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset .cse3 1)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse5 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse5 v_ArrVal_1775)) c_~datas~0.base) .cse6))))))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (let ((.cse7 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse7 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse7 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset .cse3)))))))))))) is different from false [2023-11-24 02:24:30,056 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_threadThread1of2ForFork0_~j~0 4))) (let ((.cse6 (+ c_~datas~0.offset 2 .cse3)) (.cse8 (+ c_~datas~0.offset 3 .cse3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet8|) .cse8 |c_threadThread1of2ForFork0_#t~nondet8|)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse2 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse2 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset .cse3)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse4 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse4 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset .cse3 1)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse5 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse5 v_ArrVal_1775)) c_~datas~0.base) .cse6) |c_threadThread1of2ForFork0_#t~nondet8|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse7 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse7 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse7 v_ArrVal_1775)) c_~datas~0.base) .cse8) |c_threadThread1of2ForFork0_#t~nondet8|)))))))))) is different from false [2023-11-24 02:24:30,103 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_threadThread1of2ForFork0_~j~0 4))) (let ((.cse7 (+ c_~datas~0.offset .cse3 1)) (.cse5 (+ c_~datas~0.offset 2 .cse3)) (.cse9 (+ c_~datas~0.offset 3 .cse3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet8|) .cse5 |c_threadThread1of2ForFork0_#t~nondet8|) .cse9 |c_threadThread1of2ForFork0_#t~nondet8|)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse2 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse2 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset .cse3)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse4 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse4 v_ArrVal_1775)) c_~datas~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet8|)))) (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (let ((.cse6 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse6 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse6 v_ArrVal_1775)) c_~datas~0.base) .cse7))))) (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (let ((.cse8 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse8 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse8 v_ArrVal_1775)) c_~datas~0.base) .cse9))))))))))) is different from false [2023-11-24 02:24:30,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:30,125 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 102 treesize of output 117 [2023-11-24 02:24:30,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 248 [2023-11-24 02:24:30,134 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 63 treesize of output 56 [2023-11-24 02:24:30,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:30,139 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 113 treesize of output 58 [2023-11-24 02:24:30,143 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 21 treesize of output 14 [2023-11-24 02:24:30,165 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:24:30,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:30,174 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 100 treesize of output 115 [2023-11-24 02:24:30,176 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:24:30,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 163 [2023-11-24 02:24:30,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:30,184 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 129 treesize of output 61 [2023-11-24 02:24:30,187 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 20 treesize of output 14 [2023-11-24 02:24:30,199 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:24:30,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:30,208 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 102 treesize of output 117 [2023-11-24 02:24:30,211 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:24:30,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 166 [2023-11-24 02:24:30,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:30,218 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 111 treesize of output 49 [2023-11-24 02:24:30,223 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:24:30,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:30,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 102 treesize of output 117 [2023-11-24 02:24:30,234 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 02:24:30,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 166 [2023-11-24 02:24:30,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:30,241 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 111 treesize of output 49 [2023-11-24 02:24:30,653 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1766 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| c_~datas~0.base v_ArrVal_1756))) (or (not (= c_~datas~0.base (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem15#1.base_20|)))) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| c_~datas~0.base))) is different from false [2023-11-24 02:24:30,694 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1766 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1755) c_~datas~0.base v_ArrVal_1756))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (not (= c_~datas~0.base (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| c_~datas~0.base))) is different from false [2023-11-24 02:24:30,895 WARN L854 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| |c_ULTIMATE.start_main_#t~malloc11#1.base|)) (forall ((v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1766 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1755) |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1756))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (not (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc11#1.base|)))))) is different from false [2023-11-24 02:24:30,991 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 2761 treesize of output 2141 [2023-11-24 02:24:31,042 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 144 treesize of output 140 [2023-11-24 02:24:31,046 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 143 treesize of output 135 [2023-11-24 02:24:31,051 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 110 treesize of output 102 [2023-11-24 02:24:31,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:31,173 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 34 treesize of output 39 [2023-11-24 02:24:31,210 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2023-11-24 02:24:31,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713886275] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 02:24:31,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 02:24:31,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 24] total 61 [2023-11-24 02:24:31,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755095126] [2023-11-24 02:24:31,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 02:24:31,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-11-24 02:24:31,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:24:31,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-11-24 02:24:31,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2034, Unknown=34, NotChecked=1470, Total=3782 [2023-11-24 02:24:31,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:31,213 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:24:31,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.213114754098361) internal successors, (379), 62 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:24:31,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:31,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:31,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:31,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:31,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:31,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-24 02:24:31,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:31,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-24 02:24:31,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-24 02:24:31,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:31,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-11-24 02:24:31,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:34,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:34,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:34,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:34,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:34,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:34,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 02:24:34,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:34,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-24 02:24:34,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-24 02:24:34,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:34,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-24 02:24:34,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-24 02:24:34,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-24 02:24:34,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-24 02:24:34,751 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:24:34,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:24:34,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1640465456, now seen corresponding path program 2 times [2023-11-24 02:24:34,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:24:34,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323952406] [2023-11-24 02:24:34,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:34,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:24:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:36,112 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 02:24:36,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:24:36,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323952406] [2023-11-24 02:24:36,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323952406] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 02:24:36,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408392257] [2023-11-24 02:24:36,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 02:24:36,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:24:36,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:24:36,114 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 02:24:36,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-24 02:24:36,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 02:24:36,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 02:24:36,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-24 02:24:36,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 02:24:36,337 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 [2023-11-24 02:24:36,390 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 02:24:36,390 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 15 treesize of output 15 [2023-11-24 02:24:36,532 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-24 02:24:36,533 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 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-24 02:24:36,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24: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 26 treesize of output 19 [2023-11-24 02:24:36,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-24 02:24:36,786 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 28 treesize of output 27 [2023-11-24 02:24:36,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:36,835 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 40 treesize of output 42 [2023-11-24 02:24:36,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:36,890 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 52 treesize of output 57 [2023-11-24 02:24:37,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:37,181 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 56 treesize of output 45 [2023-11-24 02:24:37,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:37,204 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 56 treesize of output 45 [2023-11-24 02:24:37,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:37,225 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 56 treesize of output 45 [2023-11-24 02:24:37,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:37,239 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 56 treesize of output 45 [2023-11-24 02:24:37,285 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-24 02:24:37,285 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 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-24 02:24:37,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:37,838 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 26 treesize of output 19 [2023-11-24 02:24:37,853 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 25 treesize of output 13 [2023-11-24 02:24:37,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:37,915 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 56 treesize of output 45 [2023-11-24 02:24:37,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:37,931 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 56 treesize of output 45 [2023-11-24 02:24:37,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:37,951 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 56 treesize of output 45 [2023-11-24 02:24:37,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:37,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-24 02:24:38,034 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 56 treesize of output 45 [2023-11-24 02:24:38,046 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 56 treesize of output 45 [2023-11-24 02:24:38,058 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 56 treesize of output 45 [2023-11-24 02:24:38,069 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 56 treesize of output 45 [2023-11-24 02:24:38,133 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-24 02:24:38,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 71 treesize of output 60 [2023-11-24 02:24:38,140 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-24 02:24:38,140 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 02:24:38,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408392257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 02:24:38,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 02:24:38,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [22] total 40 [2023-11-24 02:24:38,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894796341] [2023-11-24 02:24:38,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 02:24:38,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-24 02:24:38,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:24:38,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-24 02:24:38,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1469, Unknown=0, NotChecked=0, Total=1640 [2023-11-24 02:24:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:38,142 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:24:38,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.65) internal successors, (133), 21 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:24:38,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:38,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:38,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:38,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:38,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:38,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-24 02:24:38,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:38,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-24 02:24:38,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-24 02:24:38,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:38,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-11-24 02:24:38,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-24 02:24:38,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:41,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:24:41,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:41,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:41,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:24:41,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:41,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 02:24:41,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-24 02:24:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 02:24:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:24:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-24 02:24:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-24 02:24:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-24 02:24:41,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-24 02:24:41,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-24 02:24:41,578 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-24 02:24:41,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 02:24:41,578 INFO L85 PathProgramCache]: Analyzing trace with hash -465789449, now seen corresponding path program 1 times [2023-11-24 02:24:41,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 02:24:41,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367175238] [2023-11-24 02:24:41,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:41,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 02:24:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:42,418 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-24 02:24:42,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 02:24:42,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367175238] [2023-11-24 02:24:42,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367175238] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 02:24:42,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698222648] [2023-11-24 02:24:42,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 02:24:42,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 02:24:42,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 02:24:42,420 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) [2023-11-24 02:24:42,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-24 02:24:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 02:24:42,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-24 02:24:42,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 02:24:42,752 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 15 treesize of output 11 [2023-11-24 02:24:42,777 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 28 treesize of output 27 [2023-11-24 02:24:42,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:24:42,807 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 40 treesize of output 42 [2023-11-24 02:24:42,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:42,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 44 treesize of output 35 [2023-11-24 02:24:42,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:42,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 44 treesize of output 35 [2023-11-24 02:24:42,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:42,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 44 treesize of output 35 [2023-11-24 02:24:42,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:42,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 44 treesize of output 35 [2023-11-24 02:24:43,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:43,086 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 44 treesize of output 35 [2023-11-24 02:24:43,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:43,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 44 treesize of output 35 [2023-11-24 02:24:43,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:43,116 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 44 treesize of output 35 [2023-11-24 02:24:43,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 02:24:43,127 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 44 treesize of output 35 [2023-11-24 02:24:43,404 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-11-24 02:24:43,404 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 4 case distinctions, treesize of input 51 treesize of output 56 [2023-11-24 02:24:43,446 INFO L349 Elim1Store]: treesize reduction 39, result has 23.5 percent of original size [2023-11-24 02:24:43,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 59 [2023-11-24 02:24:43,464 INFO L349 Elim1Store]: treesize reduction 30, result has 28.6 percent of original size [2023-11-24 02:24:43,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 60 treesize of output 68 [2023-11-24 02:24:43,516 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-24 02:24:43,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 71 [2023-11-24 02:24:59,109 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-24 02:24:59,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 83 [2023-11-24 02:25:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-24 02:25:01,158 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 02:25:01,677 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_threadThread1of2ForFork0_~j~0 4))) (let ((.cse2 (+ c_~datas~0.offset 2 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet8|)))) (and (forall ((v_ArrVal_2138 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2138) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_2138 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2138) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of2ForFork0_#t~nondet8|)) (<= (+ c_threadThread1of2ForFork0_~j~0 1) c_~next_j~0) (forall ((v_ArrVal_2138 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2138) c_~datas~0.base) .cse2))))))) is different from false [2023-11-24 02:25:01,688 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_threadThread1of2ForFork0_~j~0 4))) (let ((.cse1 (+ c_~datas~0.offset .cse3 1)) (.cse2 (+ c_~datas~0.offset 2 .cse3))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet8|) .cse2 |c_threadThread1of2ForFork0_#t~nondet8|)))) (and (forall ((v_ArrVal_2138 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2138) c_~datas~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet8|)) (<= (+ c_threadThread1of2ForFork0_~j~0 1) c_~next_j~0) (forall ((v_ArrVal_2138 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2138) c_~datas~0.base) .cse2))) (forall ((v_ArrVal_2138 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2138) c_~datas~0.base) (+ c_~datas~0.offset .cse3)))))))) is different from false [2023-11-24 02:25:01,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:25:01,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 54 [2023-11-24 02:25:01,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 02:25:01,701 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 90 treesize of output 31 [2023-11-24 02:25:01,707 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-24 02:25:01,707 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 3 case distinctions, treesize of input 42 treesize of output 1 [2023-11-24 02:25:01,710 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-24 02:25:01,710 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 3 case distinctions, treesize of input 43 treesize of output 1 [2023-11-24 02:25:05,698 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-24 02:25:05,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698222648] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 02:25:05,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 02:25:05,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 40 [2023-11-24 02:25:05,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993971556] [2023-11-24 02:25:05,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 02:25:05,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-24 02:25:05,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 02:25:05,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-24 02:25:05,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1285, Unknown=26, NotChecked=150, Total=1640 [2023-11-24 02:25:05,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:25:05,700 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 02:25:05,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 7.925) internal successors, (317), 41 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 02:25:05,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:25:05,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:25:05,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:25:05,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 02:25:05,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:25:05,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-24 02:25:05,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:25:05,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-24 02:25:05,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 02:25:05,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 02:25:05,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-11-24 02:25:05,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-11-24 02:25:05,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-11-24 02:25:05,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 02:25:08,072 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] [2023-11-24 02:25:12,043 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] [2023-11-24 02:25:14,051 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] [2023-11-24 02:25:17,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:25:19,988 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] [2023-11-24 02:25:21,992 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] [2023-11-24 02:25:23,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:25:24,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:25:25,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:25:27,958 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] [2023-11-24 02:25:30,917 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] [2023-11-24 02:25:33,887 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] [2023-11-24 02:25:35,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:25:36,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:25:38,446 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] [2023-11-24 02:25:40,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:25:43,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] [2023-11-24 02:25:46,531 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] [2023-11-24 02:25:48,533 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] [2023-11-24 02:25:49,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:25:50,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:25:52,744 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] [2023-11-24 02:25:54,748 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] [2023-11-24 02:25:56,757 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] [2023-11-24 02:25:58,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:26:00,059 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] [2023-11-24 02:26:02,065 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] [2023-11-24 02:26:04,075 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] [2023-11-24 02:26:06,086 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] [2023-11-24 02:26:08,094 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] [2023-11-24 02:26:10,098 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] [2023-11-24 02:26:12,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] [2023-11-24 02:26:14,110 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] [2023-11-24 02:26:16,123 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] [2023-11-24 02:26:17,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:26:19,280 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] [2023-11-24 02:26:20,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:26:22,871 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] [2023-11-24 02:26:24,875 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] [2023-11-24 02:26:26,880 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] [2023-11-24 02:26:28,885 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] [2023-11-24 02:26:30,891 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] [2023-11-24 02:26:32,895 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] [2023-11-24 02:26:34,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:26:36,064 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] [2023-11-24 02:26:38,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] [2023-11-24 02:26:40,075 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] [2023-11-24 02:26:41,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:26:44,182 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] [2023-11-24 02:26:46,185 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] [2023-11-24 02:26:48,195 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] [2023-11-24 02:26:50,198 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] [2023-11-24 02:26:52,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:26:54,315 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] [2023-11-24 02:26:58,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:26:59,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:27:01,593 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] [2023-11-24 02:27:04,585 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] [2023-11-24 02:27:06,588 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] [2023-11-24 02:27:08,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] [2023-11-24 02:27:10,599 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] [2023-11-24 02:27:11,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:27:18,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:27:20,956 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] [2023-11-24 02:27:22,962 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] [2023-11-24 02:27:24,968 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] [2023-11-24 02:27:26,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:27:27,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:27:29,445 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] [2023-11-24 02:27:31,450 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] [2023-11-24 02:27:33,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:27:35,048 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] [2023-11-24 02:27:37,056 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] [2023-11-24 02:27:39,061 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] [2023-11-24 02:27:41,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] [2023-11-24 02:27:43,075 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] [2023-11-24 02:27:45,080 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] [2023-11-24 02:27:47,086 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] [2023-11-24 02:27:49,095 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] [2023-11-24 02:27:51,102 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] [2023-11-24 02:27:53,108 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] [2023-11-24 02:27:55,112 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] [2023-11-24 02:27:56,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:27:58,652 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] [2023-11-24 02:28:00,658 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] [2023-11-24 02:28:02,666 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] [2023-11-24 02:28:04,680 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] [2023-11-24 02:28:06,691 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] [2023-11-24 02:28:08,709 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] [2023-11-24 02:28:10,714 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] [2023-11-24 02:28:12,734 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] [2023-11-24 02:28:14,740 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] [2023-11-24 02:28:20,789 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] [2023-11-24 02:28:22,796 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] [2023-11-24 02:28:24,880 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] [2023-11-24 02:28:26,888 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] [2023-11-24 02:28:28,899 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] [2023-11-24 02:28:30,908 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] [2023-11-24 02:28:32,989 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] [2023-11-24 02:28:34,993 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] [2023-11-24 02:28:37,001 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] [2023-11-24 02:28:39,006 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] [2023-11-24 02:28:41,024 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] [2023-11-24 02:28:43,028 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] [2023-11-24 02:28:45,043 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] [2023-11-24 02:28:47,048 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] [2023-11-24 02:28:49,056 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] [2023-11-24 02:28:51,061 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] [2023-11-24 02:28:53,066 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] [2023-11-24 02:28:55,073 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] [2023-11-24 02:28:57,102 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] [2023-11-24 02:28:59,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] [2023-11-24 02:29:01,133 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] [2023-11-24 02:29:03,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] [2023-11-24 02:29:05,164 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] [2023-11-24 02:29:07,174 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] [2023-11-24 02:29:09,198 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] [2023-11-24 02:29:11,205 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] [2023-11-24 02:29:13,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] [2023-11-24 02:29:15,244 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] [2023-11-24 02:29:17,257 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] [2023-11-24 02:29:19,264 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] [2023-11-24 02:29:22,194 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] [2023-11-24 02:29:24,200 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] [2023-11-24 02:29:26,208 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] [2023-11-24 02:29:28,215 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] [2023-11-24 02:29:30,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:29:32,273 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] [2023-11-24 02:29:34,280 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] [2023-11-24 02:29:36,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] [2023-11-24 02:29:38,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] [2023-11-24 02:29:40,304 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] [2023-11-24 02:29:42,306 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] [2023-11-24 02:29:44,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] [2023-11-24 02:29:46,336 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] [2023-11-24 02:29:48,357 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] [2023-11-24 02:29:49,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:29:51,634 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] [2023-11-24 02:29:53,637 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] [2023-11-24 02:29:54,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:29:55,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:29:57,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:29:58,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:30:00,629 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] [2023-11-24 02:30:02,633 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] [2023-11-24 02:30:04,643 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] [2023-11-24 02:30:06,649 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] [2023-11-24 02:30:08,660 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] [2023-11-24 02:30:10,669 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] [2023-11-24 02:30:12,680 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] [2023-11-24 02:30:14,684 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] [2023-11-24 02:30:16,696 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] [2023-11-24 02:30:18,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] [2023-11-24 02:30:20,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] [2023-11-24 02:30:22,716 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] [2023-11-24 02:30:23,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:30:25,956 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] [2023-11-24 02:30:27,962 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] [2023-11-24 02:30:29,965 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] [2023-11-24 02:30:32,168 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] [2023-11-24 02:30:34,172 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] [2023-11-24 02:30:36,185 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] [2023-11-24 02:30:38,193 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] [2023-11-24 02:30:40,199 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] [2023-11-24 02:30:42,204 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] [2023-11-24 02:30:44,253 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] [2023-11-24 02:30:46,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] [2023-11-24 02:30:48,290 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] [2023-11-24 02:30:50,294 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] [2023-11-24 02:30:52,325 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] [2023-11-24 02:30:54,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] [2023-11-24 02:30:55,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:30:57,667 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] [2023-11-24 02:30:59,705 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] [2023-11-24 02:31:01,709 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] [2023-11-24 02:31:03,719 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] [2023-11-24 02:31:05,727 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] [2023-11-24 02:31:07,736 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] [2023-11-24 02:31:09,745 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] [2023-11-24 02:31:11,757 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] [2023-11-24 02:31:13,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] [2023-11-24 02:31:15,773 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] [2023-11-24 02:31:17,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] [2023-11-24 02:31:19,784 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] [2023-11-24 02:31:21,788 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] [2023-11-24 02:31:23,797 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] [2023-11-24 02:31:25,801 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] [2023-11-24 02:31:27,807 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] [2023-11-24 02:31:29,814 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] [2023-11-24 02:31:31,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:31:33,385 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] [2023-11-24 02:31:35,402 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] [2023-11-24 02:31:37,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] [2023-11-24 02:31:39,416 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] [2023-11-24 02:31:41,422 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] [2023-11-24 02:31:43,438 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] [2023-11-24 02:31:45,441 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] [2023-11-24 02:31:47,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] [2023-11-24 02:31:49,458 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] [2023-11-24 02:31:51,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] [2023-11-24 02:31:53,477 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] [2023-11-24 02:31:55,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] [2023-11-24 02:31:57,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] [2023-11-24 02:31:59,499 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] [2023-11-24 02:32:00,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:32:02,906 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] [2023-11-24 02:32:04,910 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] [2023-11-24 02:32:06,913 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] [2023-11-24 02:32:08,917 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] [2023-11-24 02:32:10,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:32:12,183 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] [2023-11-24 02:32:13,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:32:14,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:32:16,791 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] [2023-11-24 02:32:18,795 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] [2023-11-24 02:32:20,807 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] [2023-11-24 02:32:22,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] [2023-11-24 02:32:23,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:32:25,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:32:27,011 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] [2023-11-24 02:32:29,015 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] [2023-11-24 02:32:30,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:32:32,116 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] [2023-11-24 02:32:37,246 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] [2023-11-24 02:32:39,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] [2023-11-24 02:32:41,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] [2023-11-24 02:32:43,257 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] [2023-11-24 02:32:45,263 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] [2023-11-24 02:32:47,267 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] [2023-11-24 02:32:49,275 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] [2023-11-24 02:32:51,287 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] [2023-11-24 02:32:53,292 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] [2023-11-24 02:32:55,295 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] [2023-11-24 02:32:57,302 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] [2023-11-24 02:32:59,306 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] [2023-11-24 02:33:01,311 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] [2023-11-24 02:33:03,314 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] [2023-11-24 02:33:05,318 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] [2023-11-24 02:33:07,321 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] [2023-11-24 02:33:09,325 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] [2023-11-24 02:33:11,328 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] [2023-11-24 02:33:13,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] [2023-11-24 02:33:15,338 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] [2023-11-24 02:33:17,347 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] [2023-11-24 02:33:19,350 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] [2023-11-24 02:33:23,545 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] [2023-11-24 02:33:25,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] [2023-11-24 02:33:27,552 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] [2023-11-24 02:33:29,561 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] [2023-11-24 02:33:31,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] [2023-11-24 02:33:33,569 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] [2023-11-24 02:33:35,578 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] [2023-11-24 02:33:37,586 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] [2023-11-24 02:33:38,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:33:39,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:33:47,495 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] [2023-11-24 02:33:49,501 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] [2023-11-24 02:33:51,507 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] [2023-11-24 02:33:53,510 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] [2023-11-24 02:33:55,517 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] [2023-11-24 02:33:57,523 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] [2023-11-24 02:33:59,531 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] [2023-11-24 02:34:01,534 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] [2023-11-24 02:34:03,546 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] [2023-11-24 02:34:05,550 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] [2023-11-24 02:34:07,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] [2023-11-24 02:34:09,566 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] [2023-11-24 02:34:11,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] [2023-11-24 02:34:13,584 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] [2023-11-24 02:34:15,589 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] [2023-11-24 02:34:18,505 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] [2023-11-24 02:34:20,510 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] [2023-11-24 02:34:22,516 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] [2023-11-24 02:34:24,519 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] [2023-11-24 02:34:26,525 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] [2023-11-24 02:34:28,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:34:30,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:34:32,824 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] [2023-11-24 02:34:34,832 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] [2023-11-24 02:34:36,843 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] [2023-11-24 02:34:38,851 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] [2023-11-24 02:34:40,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:34:42,669 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] [2023-11-24 02:34:44,675 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] [2023-11-24 02:34:50,457 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] [2023-11-24 02:34:52,464 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] [2023-11-24 02:34:54,542 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] [2023-11-24 02:34:56,549 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] [2023-11-24 02:34:58,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] [2023-11-24 02:35:00,571 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] [2023-11-24 02:35:01,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:35:03,908 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] [2023-11-24 02:35:05,924 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] [2023-11-24 02:35:07,930 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] [2023-11-24 02:35:09,942 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] [2023-11-24 02:35:11,948 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] [2023-11-24 02:35:13,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] [2023-11-24 02:35:15,966 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] [2023-11-24 02:35:17,973 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] [2023-11-24 02:35:19,981 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] [2023-11-24 02:35:21,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] [2023-11-24 02:35:23,999 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] [2023-11-24 02:35:26,030 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] [2023-11-24 02:35:28,034 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] [2023-11-24 02:35:30,045 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] [2023-11-24 02:35:32,050 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] [2023-11-24 02:35:34,062 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] [2023-11-24 02:35:36,068 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] [2023-11-24 02:35:38,077 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] [2023-11-24 02:35:40,082 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] [2023-11-24 02:35:42,093 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] [2023-11-24 02:35:44,099 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] [2023-11-24 02:35:45,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:35:47,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] [2023-11-24 02:35:48,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:35:50,642 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] [2023-11-24 02:35:52,649 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] [2023-11-24 02:35:54,655 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] [2023-11-24 02:35:56,664 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] [2023-11-24 02:35:58,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:36:00,542 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] [2023-11-24 02:36:02,546 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] [2023-11-24 02:36:04,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] [2023-11-24 02:36:06,565 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] [2023-11-24 02:36:08,576 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] [2023-11-24 02:36:10,587 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] [2023-11-24 02:36:12,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] [2023-11-24 02:36:14,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] [2023-11-24 02:36:16,617 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] [2023-11-24 02:36:18,621 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] [2023-11-24 02:36:20,678 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] [2023-11-24 02:36:22,684 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] [2023-11-24 02:36:24,714 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] [2023-11-24 02:36:26,720 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] [2023-11-24 02:36:28,753 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] [2023-11-24 02:36:30,764 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] [2023-11-24 02:36:32,794 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] [2023-11-24 02:36:34,803 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] [2023-11-24 02:36:36,849 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] [2023-11-24 02:36:38,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:36:40,288 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] [2023-11-24 02:36:42,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:36:44,111 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] [2023-11-24 02:36:45,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:36:47,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:36:49,199 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] [2023-11-24 02:36:50,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:36:52,539 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] [2023-11-24 02:36:54,546 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] [2023-11-24 02:36:56,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] [2023-11-24 02:36:58,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] [2023-11-24 02:37:00,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] [2023-11-24 02:37:02,581 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] [2023-11-24 02:37:04,588 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] [2023-11-24 02:37:06,593 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] [2023-11-24 02:37:08,621 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] [2023-11-24 02:37:10,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:37:11,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:37:12,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:37:14,422 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] [2023-11-24 02:37:15,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:37:16,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:37:18,935 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] [2023-11-24 02:37:20,939 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] [2023-11-24 02:37:22,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] [2023-11-24 02:37:25,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:37:27,833 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] [2023-11-24 02:37:29,838 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] [2023-11-24 02:37:31,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:37:32,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 02:37:36,457 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] [2023-11-24 02:37:38,465 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] Killed by 15