./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct.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 b9f8638b837f9d4f066ca2de5a13579053f042517f09bc86f1b9882385463239 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-13 06:43:28,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 06:43:28,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-11-13 06:43:28,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 06:43:28,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 06:43:28,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 06:43:28,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 06:43:28,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 06:43:28,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 06:43:28,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 06:43:28,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 06:43:28,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 06:43:28,977 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 06:43:28,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 06:43:28,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 06:43:28,978 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 06:43:28,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 06:43:28,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 06:43:28,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 06:43:28,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 06:43:28,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 06:43:28,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 06:43:28,981 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-13 06:43:28,981 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 06:43:28,985 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 06:43:28,986 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 06:43:28,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 06:43:28,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 06:43:28,987 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 06:43:28,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 06:43:28,988 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-13 06:43:28,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 06:43:28,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 06:43:28,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 06:43:28,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 06:43:28,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 06:43:28,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 06:43:28,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 06:43:28,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 06:43:28,994 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-13 06:43:28,995 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-13 06:43:28,995 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-13 06:43:28,996 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-13 06:43:28,996 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 -> b9f8638b837f9d4f066ca2de5a13579053f042517f09bc86f1b9882385463239 [2024-11-13 06:43:29,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 06:43:29,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 06:43:29,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 06:43:29,349 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 06:43:29,350 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 06:43:29,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-struct.i [2024-11-13 06:43:30,849 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 06:43:31,114 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 06:43:31,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct.i [2024-11-13 06:43:31,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f862cf062/7208d7b3d8f9420d9d569f6d07fca562/FLAG0a99c091a [2024-11-13 06:43:31,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f862cf062/7208d7b3d8f9420d9d569f6d07fca562 [2024-11-13 06:43:31,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 06:43:31,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 06:43:31,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 06:43:31,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 06:43:31,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 06:43:31,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 06:43:31" (1/1) ... [2024-11-13 06:43:31,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f7e7140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:43:31, skipping insertion in model container [2024-11-13 06:43:31,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 06:43:31" (1/1) ... [2024-11-13 06:43:31,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 06:43:31,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 06:43:31,869 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 06:43:31,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 06:43:31,983 INFO L204 MainTranslator]: Completed translation [2024-11-13 06:43:31,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:43:31 WrapperNode [2024-11-13 06:43:31,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 06:43:31,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 06:43:31,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 06:43:31,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 06:43:31,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:43:31" (1/1) ... [2024-11-13 06:43:32,008 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:43:31" (1/1) ... [2024-11-13 06:43:32,052 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-11-13 06:43:32,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 06:43:32,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 06:43:32,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 06:43:32,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 06:43:32,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:43:31" (1/1) ... [2024-11-13 06:43:32,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:43:31" (1/1) ... [2024-11-13 06:43:32,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:43:31" (1/1) ... [2024-11-13 06:43:32,081 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:43:31" (1/1) ... [2024-11-13 06:43:32,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:43:31" (1/1) ... [2024-11-13 06:43:32,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:43:31" (1/1) ... [2024-11-13 06:43:32,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:43:31" (1/1) ... [2024-11-13 06:43:32,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:43:31" (1/1) ... [2024-11-13 06:43:32,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 06:43:32,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 06:43:32,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 06:43:32,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 06:43:32,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:43:31" (1/1) ... [2024-11-13 06:43:32,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 06:43:32,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:43:32,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 06:43:32,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 06:43:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 06:43:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 06:43:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 06:43:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 06:43:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-13 06:43:32,235 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-13 06:43:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 06:43:32,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 06:43:32,237 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 06:43:32,369 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 06:43:32,371 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 06:43:32,548 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 06:43:32,548 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 06:43:32,561 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 06:43:32,562 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 06:43:32,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:43:32 BoogieIcfgContainer [2024-11-13 06:43:32,562 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 06:43:32,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 06:43:32,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 06:43:32,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 06:43:32,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 06:43:31" (1/3) ... [2024-11-13 06:43:32,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70dfdff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 06:43:32, skipping insertion in model container [2024-11-13 06:43:32,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:43:31" (2/3) ... [2024-11-13 06:43:32,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70dfdff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 06:43:32, skipping insertion in model container [2024-11-13 06:43:32,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:43:32" (3/3) ... [2024-11-13 06:43:32,571 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct.i [2024-11-13 06:43:32,588 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 06:43:32,588 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-13 06:43:32,588 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 06:43:32,651 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-13 06:43:32,701 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:43:32,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-13 06:43:32,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:43:32,704 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-13 06:43:32,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-13 06:43:32,744 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 06:43:32,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2024-11-13 06:43:32,762 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54daca2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:43:32,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 06:43:33,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:43:33,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:43:33,279 INFO L85 PathProgramCache]: Analyzing trace with hash -663578502, now seen corresponding path program 1 times [2024-11-13 06:43:33,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:43:33,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753676276] [2024-11-13 06:43:33,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:43:33,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:43:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:43:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:43:33,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:43:33,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753676276] [2024-11-13 06:43:33,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753676276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:43:33,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:43:33,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 06:43:33,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165909709] [2024-11-13 06:43:33,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:43:33,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 06:43:33,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:43:33,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 06:43:33,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 06:43:33,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:33,562 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:43:33,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 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) [2024-11-13 06:43:33,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:33,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:33,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 06:43:33,591 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:43:33,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:43:33,592 INFO L85 PathProgramCache]: Analyzing trace with hash -649763536, now seen corresponding path program 1 times [2024-11-13 06:43:33,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:43:33,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689702303] [2024-11-13 06:43:33,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:43:33,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:43:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:43:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:43:34,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:43:34,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689702303] [2024-11-13 06:43:34,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689702303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:43:34,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:43:34,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:43:34,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074190569] [2024-11-13 06:43:34,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:43:34,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:43:34,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:43:34,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:43:34,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:43:34,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:34,337 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:43:34,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:43:34,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:34,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:34,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:34,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:43:34,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 06:43:34,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:43:34,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:43:34,804 INFO L85 PathProgramCache]: Analyzing trace with hash -10252985, now seen corresponding path program 1 times [2024-11-13 06:43:34,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:43:34,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126664128] [2024-11-13 06:43:34,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:43:34,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:43:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:43:35,508 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:43:35,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:43:35,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126664128] [2024-11-13 06:43:35,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126664128] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:43:35,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514576963] [2024-11-13 06:43:35,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:43:35,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:43:35,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:43:35,513 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:43:35,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 06:43:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:43:35,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 06:43:35,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:43:35,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 06:43:35,732 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:43:35,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 06:43:35,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 06:43:35,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 06:43:35,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:43:35,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-13 06:43:35,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:43:35,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-13 06:43:36,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:43:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:43:36,146 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:43:36,191 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_115 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_115 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_115 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset))) (forall ((v_ArrVal_115 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset))))) is different from false [2024-11-13 06:43:36,482 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_115 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_115 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_115 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_115 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-11-13 06:43:36,502 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_115 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_115 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_115 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_115 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_115) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-11-13 06:43:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-13 06:43:38,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514576963] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:43:38,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:43:38,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2024-11-13 06:43:38,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431109175] [2024-11-13 06:43:38,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:43:38,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 06:43:38,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:43:38,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 06:43:38,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2024-11-13 06:43:38,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:38,487 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:43:38,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.666666666666667) internal successors, (84), 19 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:43:38,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:38,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:43:38,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:41,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:41,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:43:41,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 06:43:41,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-13 06:43:41,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 06:43:42,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-13 06:43:42,126 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-13 06:43:42,128 INFO L317 ceAbstractionStarter]: Result for error location threadThread1of1ForFork0 was SAFE (1/2) [2024-11-13 06:43:42,135 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:43:42,136 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 06:43:42,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 06:43:42,138 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54daca2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:43:42,138 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-13 06:43:42,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 06:43:42,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:43:42,147 INFO L85 PathProgramCache]: Analyzing trace with hash -998780506, now seen corresponding path program 1 times [2024-11-13 06:43:42,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:43:42,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313686131] [2024-11-13 06:43:42,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:43:42,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:43:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:43:42,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:43:42,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:43:42,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313686131] [2024-11-13 06:43:42,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313686131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:43:42,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:43:42,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 06:43:42,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182044902] [2024-11-13 06:43:42,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:43:42,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 06:43:42,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:43:42,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 06:43:42,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 06:43:42,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:42,166 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:43:42,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 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) [2024-11-13 06:43:42,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:42,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:42,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 06:43:42,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 06:43:42,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:43:42,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1690337444, now seen corresponding path program 1 times [2024-11-13 06:43:42,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:43:42,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007654875] [2024-11-13 06:43:42,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:43:42,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:43:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:43:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:43:42,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:43:42,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007654875] [2024-11-13 06:43:42,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007654875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:43:42,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:43:42,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:43:42,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370956209] [2024-11-13 06:43:42,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:43:42,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:43:42,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:43:42,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:43:42,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:43:42,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:42,375 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:43:42,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:43:42,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:42,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:42,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:42,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:43:42,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 06:43:42,486 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 06:43:42,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:43:42,488 INFO L85 PathProgramCache]: Analyzing trace with hash 225505610, now seen corresponding path program 1 times [2024-11-13 06:43:42,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:43:42,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256262498] [2024-11-13 06:43:42,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:43:42,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:43:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 06:43:42,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 06:43:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 06:43:42,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 06:43:42,550 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 06:43:42,551 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-13 06:43:42,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (1 of 3 remaining) [2024-11-13 06:43:42,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (0 of 3 remaining) [2024-11-13 06:43:42,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 06:43:42,559 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-13 06:43:42,559 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2024-11-13 06:43:42,560 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 06:43:42,560 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-13 06:43:42,575 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-13 06:43:42,580 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:43:42,582 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 06:43:42,582 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of2ForFork0 ======== [2024-11-13 06:43:42,583 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54daca2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:43:42,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 06:43:42,802 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:43:42,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:43:42,803 INFO L85 PathProgramCache]: Analyzing trace with hash -366340535, now seen corresponding path program 1 times [2024-11-13 06:43:42,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:43:42,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335391711] [2024-11-13 06:43:42,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:43:42,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:43:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:43:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:43:42,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:43:42,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335391711] [2024-11-13 06:43:42,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335391711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:43:42,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:43:42,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 06:43:42,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466606182] [2024-11-13 06:43:42,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:43:42,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 06:43:42,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:43:42,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 06:43:42,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 06:43:42,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:42,829 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:43:42,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 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) [2024-11-13 06:43:42,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:42,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:42,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 06:43:42,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:43:42,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:43:42,838 INFO L85 PathProgramCache]: Analyzing trace with hash 652159709, now seen corresponding path program 1 times [2024-11-13 06:43:42,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:43:42,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173164477] [2024-11-13 06:43:42,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:43:42,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:43:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:43:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:43:43,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:43:43,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173164477] [2024-11-13 06:43:43,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173164477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:43:43,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:43:43,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:43:43,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013358721] [2024-11-13 06:43:43,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:43:43,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:43:43,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:43:43,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:43:43,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:43:43,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:43,056 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:43:43,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:43:43,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:43,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:44,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:44,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:43:44,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 06:43:44,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:43:44,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:43:44,426 INFO L85 PathProgramCache]: Analyzing trace with hash 57226996, now seen corresponding path program 1 times [2024-11-13 06:43:44,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:43:44,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800965302] [2024-11-13 06:43:44,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:43:44,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:43:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:43:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:43:44,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:43:44,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800965302] [2024-11-13 06:43:44,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800965302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:43:44,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564605098] [2024-11-13 06:43:44,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:43:44,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:43:44,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:43:44,883 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:43:44,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 06:43:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:43:44,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 06:43:44,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:43:44,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 06:43:44,993 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:43:44,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 06:43:45,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 06:43:45,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 06:43:45,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:43:45,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-13 06:43:45,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:43:45,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-13 06:43:45,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:43:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:43:45,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:43:47,283 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_286) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_286) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2024-11-13 06:43:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:43:51,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564605098] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:43:51,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:43:51,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2024-11-13 06:43:51,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438633333] [2024-11-13 06:43:51,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:43:51,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 06:43:51,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:43:51,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 06:43:51,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=241, Unknown=17, NotChecked=32, Total=342 [2024-11-13 06:43:51,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:51,244 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:43:51,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.666666666666667) internal successors, (84), 19 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:43:51,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:51,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:43:51,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:53,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:53,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:43:53,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-13 06:43:53,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 06:43:53,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:43:53,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:43:53,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:43:53,523 INFO L85 PathProgramCache]: Analyzing trace with hash -587838036, now seen corresponding path program 1 times [2024-11-13 06:43:53,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:43:53,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42339040] [2024-11-13 06:43:53,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:43:53,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:43:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:43:53,869 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 06:43:53,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:43:53,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42339040] [2024-11-13 06:43:53,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42339040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:43:53,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:43:53,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 06:43:53,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751969236] [2024-11-13 06:43:53,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:43:53,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:43:53,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:43:53,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:43:53,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:43:53,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:53,872 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:43:53,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:43:53,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:53,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:43:53,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-11-13 06:43:53,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:55,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:43:55,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:43:55,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-13 06:43:55,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:43:55,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 06:43:55,059 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:43:55,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:43:55,060 INFO L85 PathProgramCache]: Analyzing trace with hash -266507489, now seen corresponding path program 1 times [2024-11-13 06:43:55,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:43:55,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929657828] [2024-11-13 06:43:55,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:43:55,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:43:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:43:56,015 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:43:56,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:43:56,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929657828] [2024-11-13 06:43:56,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929657828] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:43:56,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740467049] [2024-11-13 06:43:56,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:43:56,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:43:56,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:43:56,017 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) [2024-11-13 06:43:56,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 06:43:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:43:56,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-13 06:43:56,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:43:56,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 06:43:56,206 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 06:43:56,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 06:43:56,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 06:43:56,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 06:43:56,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:43:56,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-13 06:43:56,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:43:56,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-13 06:43:56,818 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-13 06:43:56,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-13 06:43:56,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:43:56,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:43:57,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:43:57,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:43:57,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:43:57,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:43:57,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:43:57,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:43:57,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:43:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:43:57,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:43:57,518 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false [2024-11-13 06:43:57,566 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_460 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false [2024-11-13 06:43:57,580 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_460 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false [2024-11-13 06:43:57,613 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_459) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_459) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_459) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_459) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-11-13 06:43:57,812 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_460) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false [2024-11-13 06:43:59,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:43:59,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2024-11-13 06:43:59,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:43:59,579 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 122 treesize of output 60 [2024-11-13 06:43:59,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-13 06:43:59,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-11-13 06:43:59,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:43:59,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54 [2024-11-13 06:43:59,624 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:43:59,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:43:59,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 32 [2024-11-13 06:43:59,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:43:59,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54 [2024-11-13 06:43:59,648 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:43:59,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:43:59,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 32 [2024-11-13 06:43:59,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:43:59,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54 [2024-11-13 06:43:59,668 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:43:59,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:43:59,675 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 68 treesize of output 28 [2024-11-13 06:44:02,134 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 46 not checked. [2024-11-13 06:44:02,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740467049] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:44:02,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:44:02,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 50 [2024-11-13 06:44:02,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415651223] [2024-11-13 06:44:02,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:44:02,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-13 06:44:02,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:44:02,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-13 06:44:02,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1820, Unknown=40, NotChecked=460, Total=2550 [2024-11-13 06:44:02,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:02,139 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:44:02,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 4.76) internal successors, (238), 51 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:44:02,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:02,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:02,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-11-13 06:44:02,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:02,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:08,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:08,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:08,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 06:44:08,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:08,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-13 06:44:08,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 06:44:08,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:44:08,601 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:44:08,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:44:08,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1687412563, now seen corresponding path program 2 times [2024-11-13 06:44:08,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:44:08,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810442812] [2024-11-13 06:44:08,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:44:08,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:44:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:44:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:44:09,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:44:09,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810442812] [2024-11-13 06:44:09,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810442812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:44:09,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456791423] [2024-11-13 06:44:09,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 06:44:09,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:44:09,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:44:09,580 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:44:09,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 06:44:09,691 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 06:44:09,691 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:44:09,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-13 06:44:09,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:44:09,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 06:44:09,758 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 06:44:09,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 06:44:09,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 06:44:09,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 06:44:10,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:10,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-13 06:44:10,178 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-13 06:44:10,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-13 06:44:10,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 06:44:10,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:10,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-13 06:44:10,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:44:10,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:44:10,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:44:10,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:44:10,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:44:10,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:44:10,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:44:10,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:44:10,876 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:44:10,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:44:10,889 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_582 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_582 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_582 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_582 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false [2024-11-13 06:44:10,921 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_582 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_582 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_582 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_582 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-11-13 06:44:10,930 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_582 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_582 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_582 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_582 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false [2024-11-13 06:44:10,958 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false [2024-11-13 06:44:11,145 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false [2024-11-13 06:44:11,205 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false [2024-11-13 06:44:11,228 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_573) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_573) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) .cse0))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_573) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_573) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))))) is different from false [2024-11-13 06:44:11,321 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_573) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_573) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_573) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_573) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_582) c_threadThread1of2ForFork0_~t~0.base) .cse0))))) is different from false [2024-11-13 06:44:14,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:14,020 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 81 treesize of output 91 [2024-11-13 06:44:14,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:14,029 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 137 treesize of output 79 [2024-11-13 06:44:14,036 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 46 treesize of output 38 [2024-11-13 06:44:14,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-13 06:44:14,061 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:44:14,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:14,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 57 [2024-11-13 06:44:14,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:14,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 41 [2024-11-13 06:44:14,086 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:44:14,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:14,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 53 [2024-11-13 06:44:14,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:14,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 37 [2024-11-13 06:44:14,110 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:44:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 47 not checked. [2024-11-13 06:44:18,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456791423] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:44:18,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:44:18,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 51 [2024-11-13 06:44:18,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494019323] [2024-11-13 06:44:18,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:44:18,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-13 06:44:18,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:44:18,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-13 06:44:18,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1704, Unknown=18, NotChecked=728, Total=2652 [2024-11-13 06:44:18,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:18,477 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:44:18,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 4.666666666666667) internal successors, (238), 52 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:44:18,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:18,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:18,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-13 06:44:18,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:18,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2024-11-13 06:44:18,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:22,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:22,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:22,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 06:44:22,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:22,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-13 06:44:22,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-11-13 06:44:22,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 06:44:23,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 06:44:23,144 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:44:23,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:44:23,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1299880376, now seen corresponding path program 2 times [2024-11-13 06:44:23,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:44:23,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668722894] [2024-11-13 06:44:23,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:44:23,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:44:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:44:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 06:44:23,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:44:23,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668722894] [2024-11-13 06:44:23,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668722894] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:44:23,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822219950] [2024-11-13 06:44:23,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 06:44:23,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:44:23,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:44:23,674 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:44:23,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 06:44:23,787 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 06:44:23,787 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:44:23,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-13 06:44:23,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:44:23,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 06:44:23,820 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:44:23,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 06:44:23,871 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 [2024-11-13 06:44:23,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 20 treesize of output 15 [2024-11-13 06:44:23,892 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 [2024-11-13 06:44:23,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:23,920 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 [2024-11-13 06:44:23,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:23,952 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 [2024-11-13 06:44:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 06:44:23,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:44:24,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:24,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-13 06:44:24,813 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 26 treesize of output 18 [2024-11-13 06:44:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 06:44:24,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822219950] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:44:24,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:44:24,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 20 [2024-11-13 06:44:24,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642024724] [2024-11-13 06:44:24,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:44:24,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 06:44:24,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:44:24,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 06:44:24,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=302, Unknown=9, NotChecked=0, Total=380 [2024-11-13 06:44:24,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:24,871 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:44:24,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.45) internal successors, (89), 20 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:44:24,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:24,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:24,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-13 06:44:24,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:24,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-11-13 06:44:24,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-11-13 06:44:24,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:25,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:25,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:25,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 06:44:25,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:25,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-13 06:44:25,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-11-13 06:44:25,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 06:44:25,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 06:44:26,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-13 06:44:26,018 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:44:26,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:44:26,018 INFO L85 PathProgramCache]: Analyzing trace with hash -864983549, now seen corresponding path program 3 times [2024-11-13 06:44:26,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:44:26,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749504992] [2024-11-13 06:44:26,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:44:26,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:44:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:44:26,919 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:44:26,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:44:26,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749504992] [2024-11-13 06:44:26,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749504992] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:44:26,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736041199] [2024-11-13 06:44:26,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 06:44:26,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:44:26,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:44:26,924 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:44:26,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 06:44:27,081 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-13 06:44:27,081 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:44:27,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-13 06:44:27,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:44:27,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 06:44:27,132 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 06:44:27,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 06:44:27,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 06:44:27,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 06:44:27,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:27,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-13 06:44:27,496 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-13 06:44:27,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-13 06:44:27,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 06:44:27,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 06:44:27,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 06:44:27,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 06:44:27,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 06:44:27,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:27,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-13 06:44:27,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:44:27,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:44:27,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:44:28,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 06:44:28,043 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:44:28,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:44:28,057 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_816 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_816 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_816 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_816 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-11-13 06:44:28,087 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_816 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_816 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_816 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_816 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-11-13 06:44:28,096 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_816 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_816 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_816 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_816 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false [2024-11-13 06:44:28,219 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2024-11-13 06:44:28,232 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) .cse0))) (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) is different from false [2024-11-13 06:44:28,408 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) .cse0))) (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2024-11-13 06:44:28,540 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) .cse0))) (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_811) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_816) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) is different from false [2024-11-13 06:44:29,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-13 06:44:29,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-13 06:44:29,150 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:44:29,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:29,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 57 [2024-11-13 06:44:29,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:29,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 41 [2024-11-13 06:44:29,176 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:44:29,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:29,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 57 [2024-11-13 06:44:29,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:29,192 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 91 treesize of output 45 [2024-11-13 06:44:29,198 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:44:29,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:29,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 53 [2024-11-13 06:44:29,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:29,214 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 85 treesize of output 41 [2024-11-13 06:44:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 44 not checked. [2024-11-13 06:44:29,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736041199] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:44:29,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:44:29,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 51 [2024-11-13 06:44:29,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74673340] [2024-11-13 06:44:29,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:44:29,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-13 06:44:29,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:44:29,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-13 06:44:29,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1760, Unknown=43, NotChecked=644, Total=2652 [2024-11-13 06:44:29,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:29,666 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:44:29,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 4.666666666666667) internal successors, (238), 52 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:44:29,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:29,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:29,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-13 06:44:29,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:29,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-11-13 06:44:29,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-11-13 06:44:29,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-13 06:44:29,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:33,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:33,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:33,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 06:44:33,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:33,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-13 06:44:33,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-11-13 06:44:33,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 06:44:33,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-13 06:44:33,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 06:44:34,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-13 06:44:34,156 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:44:34,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:44:34,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1135373735, now seen corresponding path program 4 times [2024-11-13 06:44:34,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:44:34,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098537983] [2024-11-13 06:44:34,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:44:34,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:44:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:44:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:44:35,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:44:35,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098537983] [2024-11-13 06:44:35,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098537983] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:44:35,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936175650] [2024-11-13 06:44:35,034 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 06:44:35,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:44:35,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:44:35,035 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:44:35,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 06:44:35,275 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 06:44:35,275 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:44:35,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-13 06:44:35,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:44:35,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 06:44:35,334 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 06:44:35,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 06:44:35,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 06:44:35,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-13 06:44:35,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-13 06:44:35,811 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-13 06:44:35,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-13 06:44:36,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 06:44:36,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 06:44:36,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 06:44:36,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 06:44:36,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 06:44:36,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 06:44:36,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 06:44:36,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 06:44:36,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-11-13 06:44:36,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:36,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-11-13 06:44:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:44:36,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:44:37,529 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_936 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_936))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_27))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_936 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_936))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_27))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_936 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_936))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_27)))) is different from false [2024-11-13 06:44:37,959 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_936 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_27) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_936))) (store .cse0 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_936 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_936))) (store .cse1 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_27))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_936 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_936))) (store .cse2 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_27)))) is different from false [2024-11-13 06:44:38,170 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_936 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_27) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_936))) (store .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_936 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_27) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_936))) (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_936 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_27) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_936))) (store .cse2 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2024-11-13 06:44:39,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:39,199 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 59 treesize of output 52 [2024-11-13 06:44:39,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:39,212 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 394 treesize of output 346 [2024-11-13 06:44:39,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 142 [2024-11-13 06:44:39,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:39,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 105 [2024-11-13 06:44:39,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:39,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 52 [2024-11-13 06:44:39,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:39,508 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 192 treesize of output 176 [2024-11-13 06:44:39,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 157 [2024-11-13 06:44:39,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 34 [2024-11-13 06:44:39,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:39,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 50 [2024-11-13 06:44:39,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:39,646 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 314 treesize of output 282 [2024-11-13 06:44:39,657 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 138 treesize of output 130 [2024-11-13 06:44:39,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 30 [2024-11-13 06:44:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 45 not checked. [2024-11-13 06:44:40,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936175650] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:44:40,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:44:40,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 53 [2024-11-13 06:44:40,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106685909] [2024-11-13 06:44:40,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:44:40,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-13 06:44:40,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:44:40,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-13 06:44:40,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=2314, Unknown=13, NotChecked=300, Total=2862 [2024-11-13 06:44:40,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:40,299 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:44:40,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 4.6415094339622645) internal successors, (246), 54 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:44:40,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:40,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:40,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-13 06:44:40,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:40,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-11-13 06:44:40,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-11-13 06:44:40,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-13 06:44:40,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-11-13 06:44:40,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:50,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:50,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:50,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-13 06:44:50,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:50,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-11-13 06:44:50,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-11-13 06:44:50,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 06:44:50,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-11-13 06:44:50,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:44:50,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-13 06:44:50,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:44:50,566 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:44:50,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:44:50,567 INFO L85 PathProgramCache]: Analyzing trace with hash 328040159, now seen corresponding path program 5 times [2024-11-13 06:44:50,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:44:50,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729425944] [2024-11-13 06:44:50,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:44:50,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:44:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:44:51,531 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:44:51,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:44:51,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729425944] [2024-11-13 06:44:51,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729425944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:44:51,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458127492] [2024-11-13 06:44:51,533 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 06:44:51,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:44:51,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:44:51,535 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:44:51,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 06:44:51,703 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-11-13 06:44:51,704 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:44:51,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-13 06:44:51,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:44:51,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 06:44:51,774 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 06:44:51,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 06:44:52,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 06:44:52,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-13 06:44:52,165 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-13 06:44:52,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-13 06:44:52,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-13 06:44:52,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-13 06:44:52,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-13 06:44:52,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 06:44:52,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 06:44:52,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 06:44:52,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 06:44:52,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 06:44:52,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 06:44:52,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 06:44:52,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 06:44:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:44:52,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:44:52,997 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1060 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1060 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1060 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1060 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-11-13 06:44:53,327 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1059) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1059) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1059) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1059) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false [2024-11-13 06:44:53,509 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false [2024-11-13 06:44:53,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false [2024-11-13 06:44:54,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-13 06:44:54,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-13 06:44:54,542 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:44:54,546 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:44:54,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:54,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 43 [2024-11-13 06:44:54,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:54,557 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 51 treesize of output 33 [2024-11-13 06:44:54,560 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:44:54,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:54,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 47 [2024-11-13 06:44:54,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:44:54,572 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 59 treesize of output 37 [2024-11-13 06:44:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 38 not checked. [2024-11-13 06:44:55,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458127492] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:44:55,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:44:55,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 55 [2024-11-13 06:44:55,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732630720] [2024-11-13 06:44:55,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:44:55,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-13 06:44:55,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:44:55,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-13 06:44:55,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2324, Unknown=113, NotChecked=412, Total=3080 [2024-11-13 06:44:55,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:55,076 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:44:55,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 4.490909090909091) internal successors, (247), 56 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:44:55,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:44:55,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:55,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-11-13 06:44:55,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:44:55,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-11-13 06:44:55,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-11-13 06:44:55,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-13 06:44:55,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-11-13 06:44:55,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:44:55,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:45:00,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:45:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:45:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-13 06:45:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:45:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-11-13 06:45:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-11-13 06:45:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 06:45:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-11-13 06:45:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-11-13 06:45:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-13 06:45:00,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-13 06:45:00,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 06:45:00,429 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:45:00,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:45:00,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1150469173, now seen corresponding path program 6 times [2024-11-13 06:45:00,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:45:00,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517219920] [2024-11-13 06:45:00,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:45:00,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:45:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:45:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:45:01,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:45:01,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517219920] [2024-11-13 06:45:01,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517219920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:45:01,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846949418] [2024-11-13 06:45:01,374 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-13 06:45:01,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:45:01,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:45:01,376 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:45:01,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 06:45:01,536 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-11-13 06:45:01,536 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:45:01,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-13 06:45:01,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:45:01,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 06:45:01,596 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 06:45:01,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 06:45:01,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 06:45:01,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-13 06:45:02,012 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-13 06:45:02,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-13 06:45:02,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-13 06:45:02,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-13 06:45:02,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 06:45:02,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 06:45:02,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 06:45:02,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 06:45:02,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-13 06:45:02,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 06:45:02,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 06:45:02,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 06:45:02,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 06:45:02,784 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:45:02,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:45:03,076 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false [2024-11-13 06:45:03,204 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) .cse0) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))))) is different from false [2024-11-13 06:45:03,386 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) .cse0))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) is different from false [2024-11-13 06:45:03,450 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false [2024-11-13 06:45:03,631 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (and (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1177) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1182) c_threadThread1of2ForFork0_~t~0.base) .cse0))))) is different from false [2024-11-13 06:45:06,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-13 06:45:06,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-13 06:45:06,151 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:45:06,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:45:06,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 58 [2024-11-13 06:45:06,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:45:06,167 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 51 treesize of output 33 [2024-11-13 06:45:06,171 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:45:06,177 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:45:06,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:45:06,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 64 [2024-11-13 06:45:06,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:45:06,190 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 59 treesize of output 37 [2024-11-13 06:45:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 39 not checked. [2024-11-13 06:45:07,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846949418] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:45:07,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:45:07,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 21] total 55 [2024-11-13 06:45:07,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683491358] [2024-11-13 06:45:07,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:45:07,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-13 06:45:07,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:45:07,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-13 06:45:07,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2244, Unknown=114, NotChecked=510, Total=3080 [2024-11-13 06:45:07,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:45:07,984 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:45:07,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 4.4363636363636365) internal successors, (244), 56 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:45:07,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:45:07,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:45:07,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-11-13 06:45:07,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:45:07,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-11-13 06:45:07,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-11-13 06:45:07,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-13 06:45:07,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-11-13 06:45:07,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2024-11-13 06:45:07,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-11-13 06:45:07,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:45:12,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:45:12,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:45:12,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-13 06:45:12,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:45:13,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-11-13 06:45:13,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-11-13 06:45:13,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 06:45:13,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-11-13 06:45:13,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-11-13 06:45:13,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-13 06:45:13,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-13 06:45:13,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 06:45:13,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 06:45:13,204 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:45:13,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:45:13,204 INFO L85 PathProgramCache]: Analyzing trace with hash 880078987, now seen corresponding path program 7 times [2024-11-13 06:45:13,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:45:13,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069259500] [2024-11-13 06:45:13,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:45:13,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:45:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:45:14,124 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:45:14,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:45:14,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069259500] [2024-11-13 06:45:14,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069259500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:45:14,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982122683] [2024-11-13 06:45:14,125 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-13 06:45:14,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:45:14,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:45:14,127 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:45:14,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 06:45:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:45:14,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-13 06:45:14,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:45:14,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 06:45:14,295 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 06:45:14,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 06:45:14,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 06:45:14,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 06:45:14,596 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-13 06:45:14,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-13 06:45:14,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-13 06:45:14,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:45:14,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-13 06:45:14,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 06:45:14,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 06:45:14,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 06:45:15,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 06:45:15,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 06:45:15,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 06:45:15,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 06:45:15,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 06:45:15,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:45:15,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-13 06:45:15,160 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:45:15,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:45:15,182 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1303 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1303 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1303 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-11-13 06:45:15,213 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1303 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1303 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1303 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false [2024-11-13 06:45:15,286 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false [2024-11-13 06:45:15,377 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-11-13 06:45:15,468 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (and (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1293) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1293) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) .cse0))) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1293) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))))) is different from false [2024-11-13 06:45:15,514 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (and (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1293) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) .cse0))) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1293) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1293) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1303) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))))) is different from false [2024-11-13 06:45:17,440 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 46 treesize of output 38 [2024-11-13 06:45:17,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 24 treesize of output 20 [2024-11-13 06:45:17,454 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:45:17,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:45:17,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 47 [2024-11-13 06:45:17,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:45:17,464 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 59 treesize of output 37 [2024-11-13 06:45:17,468 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:45:17,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:45:17,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 43 [2024-11-13 06:45:17,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:45:17,477 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 51 treesize of output 33 [2024-11-13 06:45:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 45 not checked. [2024-11-13 06:45:19,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982122683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:45:19,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:45:19,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 47 [2024-11-13 06:45:19,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341447610] [2024-11-13 06:45:19,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:45:19,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-13 06:45:19,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:45:19,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-13 06:45:19,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1530, Unknown=46, NotChecked=510, Total=2256 [2024-11-13 06:45:19,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:45:19,793 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:45:19,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.914893617021277) internal successors, (231), 48 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:45:19,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:45:19,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:45:19,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-11-13 06:45:19,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:45:19,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-11-13 06:45:19,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-11-13 06:45:19,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-13 06:45:19,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-11-13 06:45:19,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2024-11-13 06:45:19,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-11-13 06:45:19,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-11-13 06:45:19,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:45:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:45:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:45:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-13 06:45:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:45:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-11-13 06:45:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-11-13 06:45:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 06:45:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-11-13 06:45:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-11-13 06:45:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-13 06:45:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-11-13 06:45:25,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-11-13 06:45:25,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 06:45:25,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 06:45:25,366 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 06:45:25,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:45:25,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1318713277, now seen corresponding path program 8 times [2024-11-13 06:45:25,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:45:25,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887489573] [2024-11-13 06:45:25,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:45:25,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:45:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:45:26,165 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:45:26,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:45:26,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887489573] [2024-11-13 06:45:26,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887489573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:45:26,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310509886] [2024-11-13 06:45:26,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 06:45:26,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:45:26,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:45:26,167 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:45:26,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 06:45:26,312 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 06:45:26,312 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:45:26,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-13 06:45:26,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:45:26,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 06:45:26,492 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 06:45:26,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 06:45:26,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 06:45:26,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-13 06:45:27,217 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-13 06:45:27,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-13 06:45:27,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-13 06:45:27,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-13 06:45:27,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-13 06:45:27,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-13 06:45:27,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-13 06:45:27,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-13 06:45:28,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-13 06:45:28,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2024-11-13 06:45:28,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2024-11-13 06:45:28,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 65 [2024-11-13 06:45:32,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2024-11-13 06:45:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:45:40,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:45:59,408 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse17 1)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse17 2)) (.cse5 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse17 3)) (.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse7 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse1 (store (store (select .cse2 c_threadThread1of2ForFork0_~t~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse1) |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select (store .cse2 c_threadThread1of2ForFork0_~t~0.base .cse1) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 |ULTIMATE.start_main_#t~nondet9#1|) .cse4 v_ArrVal_1426) .cse5 |ULTIMATE.start_main_#t~nondet9#1|)))))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse9 (store (store (select .cse10 c_threadThread1of2ForFork0_~t~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse9) |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select (store .cse10 c_threadThread1of2ForFork0_~t~0.base .cse9) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 |ULTIMATE.start_main_#t~nondet9#1|) .cse4 v_ArrVal_1426) .cse5 |ULTIMATE.start_main_#t~nondet9#1|)))))) (store .cse8 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse8 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse7)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (= (select (select (let ((.cse11 (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse12 (store (store (select .cse13 c_threadThread1of2ForFork0_~t~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse12) |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select (store .cse13 c_threadThread1of2ForFork0_~t~0.base .cse12) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 |ULTIMATE.start_main_#t~nondet9#1|) .cse4 v_ArrVal_1426) .cse5 |ULTIMATE.start_main_#t~nondet9#1|)))))) (store .cse11 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse11 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse6) |c_threadThread1of2ForFork0_#t~nondet4|) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse14 (let ((.cse16 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse15 (store (store (select .cse16 c_threadThread1of2ForFork0_~t~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse15) |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select (store .cse16 c_threadThread1of2ForFork0_~t~0.base .cse15) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 |ULTIMATE.start_main_#t~nondet9#1|) .cse4 v_ArrVal_1426) .cse5 |ULTIMATE.start_main_#t~nondet9#1|)))))) (store .cse14 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse14 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35)))))) is different from false [2024-11-13 06:47:45,537 INFO L349 Elim1Store]: treesize reduction 18, result has 65.4 percent of original size [2024-11-13 06:47:45,537 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 2262 treesize of output 1923 [2024-11-13 06:47:45,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:47:45,573 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 765 treesize of output 681 [2024-11-13 06:47:45,597 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 14576 treesize of output 14494 [2024-11-13 06:47:46,104 INFO L349 Elim1Store]: treesize reduction 18, result has 65.4 percent of original size [2024-11-13 06:47:46,105 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 2946 treesize of output 2591 [2024-11-13 06:47:46,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:47:46,144 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 707 treesize of output 635 [2024-11-13 06:47:46,165 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 20362 treesize of output 20234 [2024-11-13 06:47:46,729 INFO L349 Elim1Store]: treesize reduction 18, result has 65.4 percent of original size [2024-11-13 06:47:46,730 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 3362 treesize of output 2799 [2024-11-13 06:47:46,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:47:46,772 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 763 treesize of output 687 [2024-11-13 06:47:46,797 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 1250 treesize of output 1230 [2024-11-13 06:47:47,683 INFO L349 Elim1Store]: treesize reduction 31, result has 40.4 percent of original size [2024-11-13 06:47:47,684 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 2946 treesize of output 2578 [2024-11-13 06:47:47,709 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 696 treesize of output 618 [2024-11-13 06:47:47,734 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 11802 treesize of output 11770 [2024-11-13 06:48:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2024-11-13 06:48:08,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310509886] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:48:08,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:48:08,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 29, 28] total 73 [2024-11-13 06:48:08,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412818205] [2024-11-13 06:48:08,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:48:08,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-13 06:48:08,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:48:08,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-13 06:48:08,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=4826, Unknown=39, NotChecked=142, Total=5402 [2024-11-13 06:48:08,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:48:08,996 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:48:08,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 3.4657534246575343) internal successors, (253), 74 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:48:08,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:48:08,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:48:08,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-11-13 06:48:08,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:48:08,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-11-13 06:48:08,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-11-13 06:48:08,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-13 06:48:08,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-11-13 06:48:08,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-11-13 06:48:08,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-11-13 06:48:08,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-11-13 06:48:08,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2024-11-13 06:48:08,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:48:40,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 06:49:13,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:49:18,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:49:23,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:50:28,389 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse87 (select |c_#valid| |c_ULTIMATE.start_main_~tids~0#1.base|)) (.cse33 (not (= |c_ULTIMATE.start_main_~tids~0#1.base| |c_ULTIMATE.start_main_#t~malloc7#1.base|))) (.cse24 (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_65| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_65|) 0)))) (.cse25 (not (= |c_ULTIMATE.start_main_~tids~0#1.base| |c_ULTIMATE.start_main_~t~1#1.base|))) (.cse30 (* |c_ULTIMATE.start_main_~tids~0#1.offset| 3)) (.cse29 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse31 (* (- 1) |c_ULTIMATE.start_main_~tids~0#1.offset|))) (let ((.cse26 (let ((.cse91 (div (+ .cse31 |c_ULTIMATE.start_main_~t~1#1.offset| 1) 4))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse91 1)) (not (= (mod (+ .cse30 |c_ULTIMATE.start_main_~t~1#1.offset| 1) 4) 0)) (< .cse91 .cse29)))) (.cse27 (let ((.cse90 (div (+ .cse31 |c_ULTIMATE.start_main_~t~1#1.offset|) 4))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse90 1)) (< .cse90 .cse29) (not (= (mod (+ .cse30 |c_ULTIMATE.start_main_~t~1#1.offset|) 4) 0))))) (.cse32 (select |c_#race| c_threadThread1of2ForFork0_~t~0.base)) (.cse11 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse41 (or .cse24 .cse25)) (.cse42 (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ 3 |c_ULTIMATE.start_main_~i~0#1|))) (.cse73 (or .cse24 .cse33)) (.cse68 (not (= .cse87 0))) (.cse34 (let ((.cse89 (div (+ .cse31 |c_ULTIMATE.start_main_#t~malloc7#1.offset| 1) 4))) (or (not (= (mod (+ .cse30 |c_ULTIMATE.start_main_#t~malloc7#1.offset| 1) 4) 0)) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse89 1)) (< .cse89 .cse29)))) (.cse36 (let ((.cse88 (div (+ .cse31 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse88 1)) (< .cse88 .cse29) (not (= (mod (+ .cse30 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4) 0))))) (.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse2 (store (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse2) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse4 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse3 c_threadThread1of2ForFork0_~t~0.base .cse2) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse1 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse6)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (= (select (select (let ((.cse7 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse8 (store (store (select .cse9 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse8) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse10 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse9 c_threadThread1of2ForFork0_~t~0.base .cse8) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse10 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse10 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse10 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse7 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse7 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse11) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (= (select (select (let ((.cse12 (let ((.cse14 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse13 (store (store (select .cse14 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse13) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse15 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse14 c_threadThread1of2ForFork0_~t~0.base .cse13) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse15 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse15 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse15 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse12 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse12 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse16 (let ((.cse18 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse17 (store (store (select .cse18 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse17) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse19 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse18 c_threadThread1of2ForFork0_~t~0.base .cse17) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse19 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse19 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse19 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse16 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse11)))) (= (select |c_#valid| c_threadThread1of2ForFork0_~arg.base) 1) (not (= |c_ULTIMATE.start_main_~tids~0#1.base| c_threadThread1of2ForFork0_~arg.base)) (= |c_threadThread1of2ForFork0_#in~arg.offset| 0) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse20 (let ((.cse22 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse21 (store (store (select .cse22 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse21) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse23 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse22 c_threadThread1of2ForFork0_~t~0.base .cse21) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse23 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse23 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse23 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse20 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse20 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse6)) (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0))) (or .cse24 .cse25 (and .cse26 .cse27 (let ((.cse28 (div (+ .cse31 2 |c_ULTIMATE.start_main_~t~1#1.offset|) 4))) (or (< .cse28 .cse29) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse28 1)) (not (= (mod (+ 2 .cse30 |c_ULTIMATE.start_main_~t~1#1.offset|) 4) 0)))))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select .cse32 1)) (not (= |c_ULTIMATE.start_main_~tids~0#1.base| |c_threadThread1of2ForFork0_#in~arg.base|)) (or .cse24 .cse33 (and .cse34 (let ((.cse35 (div (+ (- 1) .cse31 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4))) (or (< .cse35 .cse29) (not (= (mod (+ 3 .cse30 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4) 0)) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse35 1)))) .cse36)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse37 (let ((.cse39 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse38 (store (store (select .cse39 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse38) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse40 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse39 c_threadThread1of2ForFork0_~t~0.base .cse38) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse40 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse40 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse40 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse37 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse37 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0))) (or (and (or (< 0 |c_ULTIMATE.start_main_~t~1#1.offset|) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~t~1#1.base|) 0))) .cse41) .cse42) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0) (= (select (select (let ((.cse43 (let ((.cse45 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse44 (store (store (select .cse45 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse44) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse46 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse45 c_threadThread1of2ForFork0_~t~0.base .cse44) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse46 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse46 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse46 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse43 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse43 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse11) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse47 (let ((.cse49 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse48 (store (store (select .cse49 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse48) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse50 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse49 c_threadThread1of2ForFork0_~t~0.base .cse48) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse50 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse50 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse50 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse47 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse47 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5)) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35))) (<= 0 |c_ULTIMATE.start_main_~tids~0#1.offset|) (or .cse24 (and .cse26 .cse27 (let ((.cse51 (div (+ (- 1) .cse31 |c_ULTIMATE.start_main_~t~1#1.offset|) 4))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse51 1)) (< .cse51 .cse29) (not (= (mod (+ 3 .cse30 |c_ULTIMATE.start_main_~t~1#1.offset|) 4) 0))))) .cse25) (= |c_threadThread1of2ForFork0_#t~nondet4| (select .cse32 0)) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| .cse0) (let ((.cse67 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse55 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse67 1)) (.cse56 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse67 2)) (.cse57 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse67 3))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (= (select (select (let ((.cse52 (let ((.cse54 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse53 (store (store (select .cse54 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse53) |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select (store .cse54 c_threadThread1of2ForFork0_~t~0.base .cse53) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse55 |ULTIMATE.start_main_#t~nondet9#1|) .cse56 v_ArrVal_1426) .cse57 |ULTIMATE.start_main_#t~nondet9#1|)))))) (store .cse52 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse52 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse11) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse58 (let ((.cse60 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse59 (store (store (select .cse60 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse59) |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select (store .cse60 c_threadThread1of2ForFork0_~t~0.base .cse59) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse55 |ULTIMATE.start_main_#t~nondet9#1|) .cse56 v_ArrVal_1426) .cse57 |ULTIMATE.start_main_#t~nondet9#1|)))))) (store .cse58 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse58 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse6)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (= (select (select (let ((.cse61 (let ((.cse63 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse62 (store (store (select .cse63 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse62) |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select (store .cse63 c_threadThread1of2ForFork0_~t~0.base .cse62) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse55 |ULTIMATE.start_main_#t~nondet9#1|) .cse56 v_ArrVal_1426) .cse57 |ULTIMATE.start_main_#t~nondet9#1|)))))) (store .cse61 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse61 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse64 (let ((.cse66 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse65 (store (store (select .cse66 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse65) |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select (store .cse66 c_threadThread1of2ForFork0_~t~0.base .cse65) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse55 |ULTIMATE.start_main_#t~nondet9#1|) .cse56 v_ArrVal_1426) .cse57 |ULTIMATE.start_main_#t~nondet9#1|)))))) (store .cse64 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse64 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35))))))) (or (and (or .cse25 .cse68) .cse41) .cse42) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse69 (let ((.cse71 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse70 (store (store (select .cse71 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse70) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse72 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse71 c_threadThread1of2ForFork0_~t~0.base .cse70) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse72 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse72 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse72 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse69 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse69 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse6)) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0) (< |c_threadThread2of2ForFork0_#in~arg.offset| v_threadThread2of2ForFork0_~t~0.offset_35))) (or (and .cse73 (or (< 0 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc7#1.base|) 0)))) .cse42) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (= (select (select (let ((.cse74 (let ((.cse76 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse75 (store (store (select .cse76 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse75) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse77 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse76 c_threadThread1of2ForFork0_~t~0.base .cse75) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse77 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse77 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse77 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse74 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse74 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0))) (or .cse42 (and .cse73 (or .cse33 .cse68))) (= c_threadThread1of2ForFork0_~t~0.offset 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= c_threadThread1of2ForFork0_~arg.offset 0) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse78 (let ((.cse80 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse79 (store (store (select .cse80 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse79) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse81 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse80 c_threadThread1of2ForFork0_~t~0.base .cse79) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse81 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse81 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse81 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse78 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse78 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0))) (<= 0 |c_ULTIMATE.start_main_~threads_total~0#1|) (or .cse24 .cse33 (and (let ((.cse82 (div (+ .cse31 2 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4))) (or (not (= 0 (mod (+ 2 .cse30 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4))) (< .cse82 .cse29) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse82 1)))) .cse34 .cse36)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse83 (let ((.cse85 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse84 (store (store (select .cse85 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse84) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse86 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse85 c_threadThread1of2ForFork0_~t~0.base .cse84) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse86 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse86 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse86 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse83 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse83 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5)) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0))) (= (select |c_#valid| |c_threadThread1of2ForFork0_#in~arg.base|) 1) (= .cse87 1) (not (= |c_ULTIMATE.start_main_~tids~0#1.base| c_threadThread1of2ForFork0_~t~0.base)) (= (select |c_#valid| c_threadThread1of2ForFork0_~t~0.base) 1)))) is different from true [2024-11-13 06:50:34,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:50:40,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:50:43,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:50:55,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:50:59,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:51:03,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:51:10,138 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse55 (select |c_#valid| |c_ULTIMATE.start_main_~tids~0#1.base|)) (.cse25 (not (= |c_ULTIMATE.start_main_~tids~0#1.base| |c_ULTIMATE.start_main_#t~malloc7#1.base|))) (.cse16 (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_65| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_65|) 0)))) (.cse17 (not (= |c_ULTIMATE.start_main_~tids~0#1.base| |c_ULTIMATE.start_main_~t~1#1.base|))) (.cse22 (* |c_ULTIMATE.start_main_~tids~0#1.offset| 3)) (.cse21 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse23 (* (- 1) |c_ULTIMATE.start_main_~tids~0#1.offset|))) (let ((.cse11 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse18 (let ((.cse59 (div (+ .cse23 |c_ULTIMATE.start_main_~t~1#1.offset| 1) 4))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse59 1)) (not (= (mod (+ .cse22 |c_ULTIMATE.start_main_~t~1#1.offset| 1) 4) 0)) (< .cse59 .cse21)))) (.cse19 (let ((.cse58 (div (+ .cse23 |c_ULTIMATE.start_main_~t~1#1.offset|) 4))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse58 1)) (< .cse58 .cse21) (not (= (mod (+ .cse22 |c_ULTIMATE.start_main_~t~1#1.offset|) 4) 0))))) (.cse24 (select |c_#race| c_threadThread1of2ForFork0_~t~0.base)) (.cse33 (or .cse16 .cse17)) (.cse34 (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ 3 |c_ULTIMATE.start_main_~i~0#1|))) (.cse41 (or .cse16 .cse25)) (.cse40 (not (= .cse55 0))) (.cse26 (let ((.cse57 (div (+ .cse23 |c_ULTIMATE.start_main_#t~malloc7#1.offset| 1) 4))) (or (not (= (mod (+ .cse22 |c_ULTIMATE.start_main_#t~malloc7#1.offset| 1) 4) 0)) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse57 1)) (< .cse57 .cse21)))) (.cse28 (let ((.cse56 (div (+ .cse23 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse56 1)) (< .cse56 .cse21) (not (= (mod (+ .cse22 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4) 0))))) (.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_threadThread2of2ForFork0_#in~arg.offset| 0) (not (= |c_ULTIMATE.start_main_~tids~0#1.base| |c_threadThread2of2ForFork0_#in~arg.base|)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse2 (store (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse2) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse4 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse3 c_threadThread1of2ForFork0_~t~0.base .cse2) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse1 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse6)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse8 (store (store (select .cse9 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse8) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse10 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse9 c_threadThread1of2ForFork0_~t~0.base .cse8) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse10 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse10 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse10 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse7 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse11)))) (= (select |c_#valid| c_threadThread1of2ForFork0_~arg.base) 1) (not (= |c_ULTIMATE.start_main_~tids~0#1.base| c_threadThread1of2ForFork0_~arg.base)) (= |c_threadThread1of2ForFork0_#in~arg.offset| 0) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse12 (let ((.cse14 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse13 (store (store (select .cse14 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse13) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse15 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse14 c_threadThread1of2ForFork0_~t~0.base .cse13) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse15 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse15 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse15 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse12 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse12 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse6)) (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0))) (or .cse16 .cse17 (and .cse18 .cse19 (let ((.cse20 (div (+ .cse23 2 |c_ULTIMATE.start_main_~t~1#1.offset|) 4))) (or (< .cse20 .cse21) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse20 1)) (not (= (mod (+ 2 .cse22 |c_ULTIMATE.start_main_~t~1#1.offset|) 4) 0)))))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select .cse24 1)) (not (= |c_ULTIMATE.start_main_~tids~0#1.base| |c_threadThread1of2ForFork0_#in~arg.base|)) (or .cse16 .cse25 (and .cse26 (let ((.cse27 (div (+ (- 1) .cse23 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4))) (or (< .cse27 .cse21) (not (= (mod (+ 3 .cse22 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4) 0)) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse27 1)))) .cse28)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse29 (let ((.cse31 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse30 (store (store (select .cse31 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse30) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse32 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse31 c_threadThread1of2ForFork0_~t~0.base .cse30) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse32 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse32 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse32 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse29 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0))) (or (and (or (< 0 |c_ULTIMATE.start_main_~t~1#1.offset|) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~t~1#1.base|) 0))) .cse33) .cse34) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0) (= (select (select (let ((.cse35 (let ((.cse37 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse36 (store (store (select .cse37 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse36) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse38 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse37 c_threadThread1of2ForFork0_~t~0.base .cse36) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse38 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse38 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse38 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse35 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse35 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse11) |c_threadThread1of2ForFork0_#t~nondet4|))) (<= 0 |c_ULTIMATE.start_main_~tids~0#1.offset|) (or .cse16 (and .cse18 .cse19 (let ((.cse39 (div (+ (- 1) .cse23 |c_ULTIMATE.start_main_~t~1#1.offset|) 4))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse39 1)) (< .cse39 .cse21) (not (= (mod (+ 3 .cse22 |c_ULTIMATE.start_main_~t~1#1.offset|) 4) 0))))) .cse17) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select .cse24 0)) (not (= |c_threadThread2of2ForFork0_#in~arg.base| c_threadThread1of2ForFork0_~t~0.base)) (or (and (or .cse17 .cse40) .cse33) .cse34) (or (and .cse41 (or (< 0 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc7#1.base|) 0)))) .cse34) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (= (select (select (let ((.cse42 (let ((.cse44 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse43 (store (store (select .cse44 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse43) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse45 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse44 c_threadThread1of2ForFork0_~t~0.base .cse43) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse45 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse45 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse45 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse42 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse42 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0))) (or .cse34 (and .cse41 (or .cse25 .cse40))) (= c_threadThread1of2ForFork0_~t~0.offset 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= c_threadThread1of2ForFork0_~arg.offset 0) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_#t~malloc7#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse46 (let ((.cse48 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse47 (store (store (select .cse48 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse47) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse49 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse48 c_threadThread1of2ForFork0_~t~0.base .cse47) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse49 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse49 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse49 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse46 |c_ULTIMATE.start_main_#t~malloc7#1.base| (store (select .cse46 |c_ULTIMATE.start_main_#t~malloc7#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0))) (<= 0 |c_ULTIMATE.start_main_~threads_total~0#1|) (or .cse16 .cse25 (and (let ((.cse50 (div (+ .cse23 2 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4))) (or (not (= 0 (mod (+ 2 .cse22 |c_ULTIMATE.start_main_#t~malloc7#1.offset|) 4))) (< .cse50 .cse21) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ .cse50 1)))) .cse26 .cse28)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1426 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_ArrVal_1419 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse51 (let ((.cse53 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_1419))) (let ((.cse52 (store (store (select .cse53 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base .cse52) |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse54 (* |v_ULTIMATE.start_main_~i~0#1_44| 4))) (store (store (store (select (store .cse53 c_threadThread1of2ForFork0_~t~0.base .cse52) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse54 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse54 2) v_ArrVal_1426) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse54 3) |ULTIMATE.start_main_#t~nondet9#1|))))))) (store .cse51 |c_ULTIMATE.start_main_~t~1#1.base| (store (select .cse51 |c_ULTIMATE.start_main_~t~1#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5)) (< |c_ULTIMATE.start_main_~threads_total~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1)) (< |c_ULTIMATE.start_main_~t~1#1.offset| v_threadThread2of2ForFork0_~t~0.offset_35) (< |v_ULTIMATE.start_main_~i~0#1_44| .cse0))) (= (select |c_#valid| |c_threadThread1of2ForFork0_#in~arg.base|) 1) (= .cse55 1) (not (= |c_ULTIMATE.start_main_~tids~0#1.base| c_threadThread1of2ForFork0_~t~0.base)) (= (select |c_#valid| c_threadThread1of2ForFork0_~t~0.base) 1)))) is different from true [2024-11-13 06:51:15,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:51:17,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:51:24,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:51:26,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] [2024-11-13 06:51:32,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:51:34,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:51:36,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:51:38,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:51:40,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:51:57,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 06:52:15,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:52:17,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:52:19,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] [2024-11-13 06:52:21,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:52:24,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:52:26,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:52:30,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:52:37,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:52:39,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:52:42,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:52:45,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:52:47,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:52:49,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:52:51,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:52:54,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] [2024-11-13 06:53:02,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:53:09,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:53:22,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:53:25,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:53:28,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:53:33,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:53:35,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:53:37,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] [2024-11-13 06:53:39,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] [2024-11-13 06:53:41,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:53:43,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:53:45,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:54:17,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:54:19,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:54:28,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:54:30,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:54:32,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:54:35,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] [2024-11-13 06:54:37,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:54:39,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:54:41,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] [2024-11-13 06:54:44,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:54:46,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:54:48,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:54:50,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:54:52,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:54:54,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:54:56,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:55:02,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] [2024-11-13 06:55:04,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:55:07,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:55:24,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:55:27,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] [2024-11-13 06:55:38,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:55:40,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:55:42,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] [2024-11-13 06:55:48,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:55:50,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:55:52,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:55:54,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:55:56,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] [2024-11-13 06:55:58,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:01,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:03,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:05,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:07,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:10,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:12,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:14,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:16,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:18,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:20,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:22,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:24,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:26,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:28,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:34,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:36,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:38,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:40,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:42,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:45,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:47,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:49,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:51,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:53,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:56:55,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:57:03,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:57:05,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:57:07,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] [2024-11-13 06:57:09,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:57:11,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:57:13,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] [2024-11-13 06:57:15,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:57:17,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:57:19,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:57:21,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:57:23,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:57:25,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:57:27,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:57:30,006 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