./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-ext/10_fmaxsym_cas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 20174008 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/10_fmaxsym_cas.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 a11d0cba01cb66911cac56797cb36d325dc008752ffb55c25c965bd0644c21c3 --- Real Ultimate output --- This is Ultimate 0.2.3-?-2017400-m [2023-11-24 10:42:34,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 10:42:35,039 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-24 10:42:35,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 10:42:35,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 10:42:35,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 10:42:35,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 10:42:35,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 10:42:35,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 10:42:35,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 10:42:35,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 10:42:35,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 10:42:35,066 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 10:42:35,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 10:42:35,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 10:42:35,067 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 10:42:35,068 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 10:42:35,068 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 10:42:35,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 10:42:35,069 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 10:42:35,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 10:42:35,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 10:42:35,070 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-24 10:42:35,071 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 10:42:35,071 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 10:42:35,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 10:42:35,072 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 10:42:35,072 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 10:42:35,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 10:42:35,073 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-24 10:42:35,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 10:42:35,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 10:42:35,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 10:42:35,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 10:42:35,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 10:42:35,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 10:42:35,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 10:42:35,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 10:42:35,075 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-24 10:42:35,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-24 10:42:35,076 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 10:42:35,076 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-24 10:42:35,076 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-24 10:42:35,076 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 -> a11d0cba01cb66911cac56797cb36d325dc008752ffb55c25c965bd0644c21c3 [2023-11-24 10:42:35,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 10:42:35,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 10:42:35,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 10:42:35,296 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 10:42:35,297 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 10:42:35,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/10_fmaxsym_cas.i [2023-11-24 10:42:36,474 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 10:42:36,736 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 10:42:36,737 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/10_fmaxsym_cas.i [2023-11-24 10:42:36,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8852452f0/31c71fce0f7f4f108b66250187472be0/FLAGc6ca79d00 [2023-11-24 10:42:36,761 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8852452f0/31c71fce0f7f4f108b66250187472be0 [2023-11-24 10:42:36,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 10:42:36,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 10:42:36,767 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 10:42:36,767 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 10:42:36,771 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 10:42:36,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:42:36" (1/1) ... [2023-11-24 10:42:36,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@612f22a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:42:36, skipping insertion in model container [2023-11-24 10:42:36,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:42:36" (1/1) ... [2023-11-24 10:42:36,802 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 10:42:37,092 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 10:42:37,103 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 10:42:37,156 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 10:42:37,190 INFO L206 MainTranslator]: Completed translation [2023-11-24 10:42:37,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:42:37 WrapperNode [2023-11-24 10:42:37,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 10:42:37,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 10:42:37,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 10:42:37,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 10:42:37,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:42:37" (1/1) ... [2023-11-24 10:42:37,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:42:37" (1/1) ... [2023-11-24 10:42:37,240 INFO L138 Inliner]: procedures = 170, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 145 [2023-11-24 10:42:37,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 10:42:37,247 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 10:42:37,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 10:42:37,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 10:42:37,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:42:37" (1/1) ... [2023-11-24 10:42:37,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:42:37" (1/1) ... [2023-11-24 10:42:37,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:42:37" (1/1) ... [2023-11-24 10:42:37,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:42:37" (1/1) ... [2023-11-24 10:42:37,266 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:42:37" (1/1) ... [2023-11-24 10:42:37,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:42:37" (1/1) ... [2023-11-24 10:42:37,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:42:37" (1/1) ... [2023-11-24 10:42:37,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:42:37" (1/1) ... [2023-11-24 10:42:37,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 10:42:37,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 10:42:37,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 10:42:37,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 10:42:37,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:42:37" (1/1) ... [2023-11-24 10:42:37,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 10:42:37,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 10:42:37,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 10:42:37,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 10:42:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 10:42:37,496 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-24 10:42:37,496 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-24 10:42:37,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 10:42:37,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 10:42:37,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 10:42:37,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 10:42:37,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-24 10:42:37,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 10:42:37,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 10:42:37,498 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 10:42:37,645 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 10:42:37,646 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 10:42:37,912 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 10:42:38,069 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 10:42:38,069 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-24 10:42:38,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:42:38 BoogieIcfgContainer [2023-11-24 10:42:38,071 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 10:42:38,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 10:42:38,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 10:42:38,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 10:42:38,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 10:42:36" (1/3) ... [2023-11-24 10:42:38,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88ded96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:42:38, skipping insertion in model container [2023-11-24 10:42:38,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:42:37" (2/3) ... [2023-11-24 10:42:38,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88ded96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:42:38, skipping insertion in model container [2023-11-24 10:42:38,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:42:38" (3/3) ... [2023-11-24 10:42:38,082 INFO L112 eAbstractionObserver]: Analyzing ICFG 10_fmaxsym_cas.i [2023-11-24 10:42:38,116 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 10:42:38,125 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 10:42:38,126 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-24 10:42:38,126 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 10:42:38,189 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 10:42:38,233 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 10:42:38,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 10:42:38,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 10:42:38,235 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-24 10:42:38,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-24 10:42:38,267 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 10:42:38,276 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2023-11-24 10:42:38,281 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1d2a78e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 10:42:38,282 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-24 10:42:38,510 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 10:42:38,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:42:38,515 INFO L85 PathProgramCache]: Analyzing trace with hash 986175941, now seen corresponding path program 1 times [2023-11-24 10:42:38,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:42:38,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712001775] [2023-11-24 10:42:38,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:42:38,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:42:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:42:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 10:42:38,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 10:42:38,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712001775] [2023-11-24 10:42:38,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712001775] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 10:42:38,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 10:42:38,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 10:42:38,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598621988] [2023-11-24 10:42:38,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 10:42:38,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 10:42:38,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 10:42:38,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 10:42:38,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 10:42:38,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:38,870 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 10:42:38,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 10:42:38,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:38,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:38,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 10:42:38,909 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 10:42:38,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:42:38,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1433494246, now seen corresponding path program 1 times [2023-11-24 10:42:38,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:42:38,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140572698] [2023-11-24 10:42:38,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:42:38,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:42:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:42:39,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 10:42:39,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 10:42:39,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140572698] [2023-11-24 10:42:39,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140572698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 10:42:39,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 10:42:39,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 10:42:39,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776598831] [2023-11-24 10:42:39,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 10:42:39,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 10:42:39,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 10:42:39,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 10:42:39,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 10:42:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:39,474 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 10:42:39,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 10:42:39,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:39,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:39,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:39,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:42:39,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 10:42:39,690 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 10:42:39,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:42:39,690 INFO L85 PathProgramCache]: Analyzing trace with hash 717922415, now seen corresponding path program 1 times [2023-11-24 10:42:39,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:42:39,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67556918] [2023-11-24 10:42:39,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:42:39,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:42:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:42:40,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 10:42:40,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 10:42:40,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67556918] [2023-11-24 10:42:40,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67556918] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 10:42:40,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 10:42:40,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 10:42:40,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968096503] [2023-11-24 10:42:40,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 10:42:40,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 10:42:40,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 10:42:40,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 10:42:40,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 10:42:40,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:40,028 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 10:42:40,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 10:42:40,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:40,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:42:40,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:41,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:41,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:42:41,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:42:41,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 10:42:41,737 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 10:42:41,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:42:41,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1273239551, now seen corresponding path program 1 times [2023-11-24 10:42:41,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:42:41,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617609288] [2023-11-24 10:42:41,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:42:41,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:42:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:42:42,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 10:42:42,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 10:42:42,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617609288] [2023-11-24 10:42:42,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617609288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 10:42:42,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 10:42:42,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 10:42:42,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207695388] [2023-11-24 10:42:42,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 10:42:42,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 10:42:42,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 10:42:42,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 10:42:42,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 10:42:42,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:42,124 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 10:42:42,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 10:42:42,125 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:42,125 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:42:42,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:42:42,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:43,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:43,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:42:43,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:42:43,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:42:43,825 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2023-11-24 10:42:43,825 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2023-11-24 10:42:43,825 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2023-11-24 10:42:43,825 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2023-11-24 10:42:43,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2023-11-24 10:42:43,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2023-11-24 10:42:43,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2023-11-24 10:42:43,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2023-11-24 10:42:43,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 10:42:43,852 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-24 10:42:43,853 INFO L307 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-11-24 10:42:43,856 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 10:42:43,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 10:42:43,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 10:42:43,897 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-24 10:42:43,903 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 10:42:43,903 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-24 10:42:43,903 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1d2a78e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 10:42:43,903 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 10:42:43,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2023-11-24 10:42:44,010 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 10:42:44,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:42:44,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1952677489, now seen corresponding path program 1 times [2023-11-24 10:42:44,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:42:44,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219776337] [2023-11-24 10:42:44,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:42:44,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:42:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 10:42:44,024 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 10:42:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 10:42:44,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 10:42:44,050 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 10:42:44,050 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-11-24 10:42:44,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 10:42:44,052 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-11-24 10:42:44,052 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2023-11-24 10:42:44,053 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-24 10:42:44,053 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-24 10:42:44,129 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 10:42:44,140 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 10:42:44,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 10:42:44,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 10:42:44,142 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-24 10:42:44,146 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 10:42:44,146 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-24 10:42:44,146 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1d2a78e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 10:42:44,146 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 10:42:44,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2023-11-24 10:42:44,318 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 10:42:44,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:42:44,319 INFO L85 PathProgramCache]: Analyzing trace with hash -978062651, now seen corresponding path program 1 times [2023-11-24 10:42:44,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:42:44,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657760006] [2023-11-24 10:42:44,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:42:44,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:42:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 10:42:44,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 10:42:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 10:42:44,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 10:42:44,336 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 10:42:44,336 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-11-24 10:42:44,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 10:42:44,337 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-11-24 10:42:44,338 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2023-11-24 10:42:44,338 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-24 10:42:44,338 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-24 10:42:44,407 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 10:42:44,411 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 10:42:44,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 10:42:44,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 10:42:44,440 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-24 10:42:44,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2023-11-24 10:42:44,475 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 10:42:44,476 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2023-11-24 10:42:44,476 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1d2a78e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 10:42:44,476 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-24 10:42:44,702 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 10:42:44,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:42:44,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1399751376, now seen corresponding path program 1 times [2023-11-24 10:42:44,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:42:44,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358816070] [2023-11-24 10:42:44,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:42:44,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:42:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:42:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-24 10:42:44,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 10:42:44,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358816070] [2023-11-24 10:42:44,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358816070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 10:42:44,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 10:42:44,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 10:42:44,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439394640] [2023-11-24 10:42:44,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 10:42:44,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 10:42:44,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 10:42:44,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 10:42:44,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 10:42:44,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:44,738 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 10:42:44,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 10:42:44,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:44,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:44,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 10:42:44,767 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 10:42:44,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:42:44,767 INFO L85 PathProgramCache]: Analyzing trace with hash 109602827, now seen corresponding path program 1 times [2023-11-24 10:42:44,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:42:44,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832391464] [2023-11-24 10:42:44,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:42:44,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:42:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:42:45,023 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-24 10:42:45,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 10:42:45,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832391464] [2023-11-24 10:42:45,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832391464] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 10:42:45,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 10:42:45,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 10:42:45,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217637261] [2023-11-24 10:42:45,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 10:42:45,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 10:42:45,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 10:42:45,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 10:42:45,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 10:42:45,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:45,026 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 10:42:45,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 10:42:45,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:45,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:45,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:45,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:42:45,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 10:42:45,336 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 10:42:45,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:42:45,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1854889766, now seen corresponding path program 1 times [2023-11-24 10:42:45,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:42:45,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608412640] [2023-11-24 10:42:45,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:42:45,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:42:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:42:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-24 10:42:45,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 10:42:45,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608412640] [2023-11-24 10:42:45,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608412640] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 10:42:45,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 10:42:45,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 10:42:45,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549591273] [2023-11-24 10:42:45,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 10:42:45,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 10:42:45,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 10:42:45,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 10:42:45,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 10:42:45,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:45,570 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 10:42:45,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 10:42:45,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:45,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:42:45,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:48,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:48,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:42:48,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:42:48,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 10:42:48,184 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 10:42:48,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:42:48,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1341123412, now seen corresponding path program 1 times [2023-11-24 10:42:48,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:42:48,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129988782] [2023-11-24 10:42:48,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:42:48,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:42:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:42:48,453 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-24 10:42:48,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 10:42:48,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129988782] [2023-11-24 10:42:48,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129988782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 10:42:48,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 10:42:48,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 10:42:48,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784060831] [2023-11-24 10:42:48,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 10:42:48,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 10:42:48,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 10:42:48,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 10:42:48,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 10:42:48,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:48,456 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 10:42:48,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 10:42:48,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:42:48,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:42:48,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:42:48,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:43:45,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:43:45,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:43:45,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:43:45,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:43:45,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 10:43:45,517 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 10:43:45,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:43:45,518 INFO L85 PathProgramCache]: Analyzing trace with hash -102186891, now seen corresponding path program 1 times [2023-11-24 10:43:45,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:43:45,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733739914] [2023-11-24 10:43:45,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:43:45,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:43:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:43:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9615 backedges. 9598 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-24 10:43:50,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 10:43:50,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733739914] [2023-11-24 10:43:50,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733739914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 10:43:50,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 10:43:50,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2023-11-24 10:43:50,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831250540] [2023-11-24 10:43:50,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 10:43:50,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-24 10:43:50,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 10:43:50,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-24 10:43:50,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2023-11-24 10:43:50,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:43:50,920 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 10:43:50,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 21.80851063829787) internal successors, (1025), 47 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 10:43:50,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:43:50,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:43:50,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:43:50,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:43:50,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:45:52,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:45:52,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:45:52,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:45:52,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:45:52,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 10:45:52,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 10:45:52,687 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 10:45:52,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:45:52,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1895473705, now seen corresponding path program 1 times [2023-11-24 10:45:52,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:45:52,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355906921] [2023-11-24 10:45:52,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:45:52,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:45:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:45:56,890 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-24 10:45:56,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 10:45:56,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355906921] [2023-11-24 10:45:56,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355906921] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 10:45:56,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010999734] [2023-11-24 10:45:56,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:45:56,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 10:45:56,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 10:45:56,892 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 10:45:56,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 10:45:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:45:57,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 78 conjunts are in the unsatisfiable core [2023-11-24 10:45:57,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 10:45:58,661 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-24 10:45:58,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2023-11-24 10:45:58,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2023-11-24 10:45:59,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2023-11-24 10:45:59,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2023-11-24 10:46:00,687 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-24 10:46:00,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-24 10:46:02,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 10:46:02,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:46:02,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 10 [2023-11-24 10:46:02,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:46:02,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 10 [2023-11-24 10:46:02,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 10:46:02,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 75 treesize of output 63 [2023-11-24 10:46:02,362 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 8 treesize of output 7 [2023-11-24 10:46:02,381 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 7 treesize of output 5 [2023-11-24 10:46:03,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-24 10:46:05,151 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 34 proven. 19 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-24 10:46:05,151 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 10:46:05,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:46:05,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 13 [2023-11-24 10:46:05,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2023-11-24 10:46:05,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:46:05,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 13 [2023-11-24 10:46:05,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-24 10:46:05,945 INFO L349 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-11-24 10:46:05,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 217 treesize of output 246 [2023-11-24 10:46:05,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2023-11-24 10:46:06,000 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-24 10:46:06,000 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 2 case distinctions, treesize of input 152 treesize of output 125 [2023-11-24 10:46:06,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2023-11-24 10:46:06,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2023-11-24 10:46:06,543 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2007 (Array Int Int)) (|thr1Thread3of3ForFork0_findMax_~#cret~0#1.offset| Int)) (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |c_~#max~0.base| v_ArrVal_2007))) (store .cse2 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base| (store (select .cse2 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base|) |thr1Thread3of3ForFork0_findMax_~#cret~0#1.offset| 1))))) (let ((.cse0 (select (select .cse1 |c_~#max~0.base|) |c_~#max~0.offset|))) (or (< .cse0 |c_thr1Thread3of3ForFork0_findMax_~e~0#1|) (< (select (select .cse1 |c_~#storage~0.base|) (+ (* |c_thr1Thread3of3ForFork0_findMax_~i~0#1| 4) 4 |c_~#storage~0.offset|)) (+ .cse0 1)))))) is different from false [2023-11-24 10:46:06,609 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2007 (Array Int Int)) (|thr1Thread3of3ForFork0_findMax_~#cret~0#1.offset| Int)) (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |c_~#max~0.base| v_ArrVal_2007))) (store .cse2 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base| (store (select .cse2 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base|) |thr1Thread3of3ForFork0_findMax_~#cret~0#1.offset| 1))))) (let ((.cse0 (select (select .cse1 |c_~#max~0.base|) |c_~#max~0.offset|))) (or (< .cse0 |c_thr1Thread3of3ForFork0_findMax_#t~mem8#1|) (< (select (select .cse1 |c_~#storage~0.base|) (+ (* |c_thr1Thread3of3ForFork0_findMax_~i~0#1| 4) 4 |c_~#storage~0.offset|)) (+ .cse0 1)))))) is different from false [2023-11-24 10:46:06,648 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2007 (Array Int Int)) (|thr1Thread3of3ForFork0_findMax_~#cret~0#1.offset| Int)) (let ((.cse0 (let ((.cse3 (store |c_#memory_int| |c_~#max~0.base| v_ArrVal_2007))) (store .cse3 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base| (store (select .cse3 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base|) |thr1Thread3of3ForFork0_findMax_~#cret~0#1.offset| 1))))) (let ((.cse2 (select (select .cse0 |c_~#max~0.base|) |c_~#max~0.offset|)) (.cse1 (* |c_thr1Thread3of3ForFork0_findMax_~i~0#1| 4))) (or (< (select (select .cse0 |c_~#storage~0.base|) (+ .cse1 4 |c_~#storage~0.offset|)) (+ .cse2 1)) (< .cse2 (select (select |c_#memory_int| |c_~#storage~0.base|) (+ .cse1 |c_~#storage~0.offset|))))))) is different from false [2023-11-24 10:46:06,661 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2007 (Array Int Int)) (|thr1Thread3of3ForFork0_findMax_~#cret~0#1.offset| Int)) (let ((.cse0 (let ((.cse3 (store |c_#memory_int| |c_~#max~0.base| v_ArrVal_2007))) (store .cse3 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base| (store (select .cse3 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base|) |thr1Thread3of3ForFork0_findMax_~#cret~0#1.offset| 1))))) (let ((.cse2 (select (select .cse0 |c_~#max~0.base|) |c_~#max~0.offset|)) (.cse1 (* |c_thr1Thread3of3ForFork0_findMax_~offset#1| 4))) (or (< (select (select .cse0 |c_~#storage~0.base|) (+ .cse1 4 |c_~#storage~0.offset|)) (+ .cse2 1)) (< .cse2 (select (select |c_#memory_int| |c_~#storage~0.base|) (+ .cse1 |c_~#storage~0.offset|))))))) is different from false [2023-11-24 10:46:09,574 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 10:46:09,576 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 10:46:09,578 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 10:46:09,591 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-24 10:46:09,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 630 treesize of output 582 [2023-11-24 10:46:09,620 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2023-11-24 10:46:09,621 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 341 treesize of output 288 [2023-11-24 10:46:09,706 INFO L349 Elim1Store]: treesize reduction 55, result has 48.6 percent of original size [2023-11-24 10:46:09,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 23 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 13 case distinctions, treesize of input 324 treesize of output 301 [2023-11-24 10:46:10,636 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 11 not checked. [2023-11-24 10:46:10,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010999734] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 10:46:10,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 10:46:10,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 36] total 103 [2023-11-24 10:46:10,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462309153] [2023-11-24 10:46:10,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 10:46:10,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2023-11-24 10:46:10,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 10:46:10,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2023-11-24 10:46:10,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=868, Invalid=8791, Unknown=59, NotChecked=788, Total=10506 [2023-11-24 10:46:10,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:46:10,644 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 10:46:10,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 3.6601941747572817) internal successors, (377), 103 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 10:46:10,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:46:10,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:46:10,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:46:10,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:46:10,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 10:46:10,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:50:01,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:50:01,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:50:01,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:50:01,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:50:01,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 10:50:01,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-11-24 10:50:01,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-24 10:50:02,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-24 10:50:02,137 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 10:50:02,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:50:02,138 INFO L85 PathProgramCache]: Analyzing trace with hash -953604461, now seen corresponding path program 1 times [2023-11-24 10:50:02,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:50:02,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741261056] [2023-11-24 10:50:02,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:50:02,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:50:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:50:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 43 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-24 10:50:06,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 10:50:06,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741261056] [2023-11-24 10:50:06,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741261056] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 10:50:06,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007177770] [2023-11-24 10:50:06,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:50:06,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 10:50:06,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 10:50:06,080 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 10:50:06,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-24 10:50:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:50:06,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 84 conjunts are in the unsatisfiable core [2023-11-24 10:50:06,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 10:50:07,554 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-24 10:50:07,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2023-11-24 10:50:07,722 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 10:50:07,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 40 [2023-11-24 10:50:07,978 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 10:50:07,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2023-11-24 10:50:08,310 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 10:50:08,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2023-11-24 10:50:09,415 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-24 10:50:09,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-24 10:50:11,053 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-24 10:50:11,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 81 [2023-11-24 10:50:11,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-24 10:50:11,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 19 [2023-11-24 10:50:13,393 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2023-11-24 10:50:13,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 80 [2023-11-24 10:50:15,315 INFO L349 Elim1Store]: treesize reduction 50, result has 12.3 percent of original size [2023-11-24 10:50:15,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 28 [2023-11-24 10:50:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-24 10:50:15,443 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 10:50:16,272 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_y_5 Int) (v_ArrVal_2312 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2312))) (< (select (select .cse0 |c_~#storage~0.base|) (+ (* v_y_5 8) |c_~#storage~0.offset|)) (+ (select (select .cse0 |c_~#max~0.base|) |c_~#max~0.offset|) 1))) (< v_y_5 0) (< 2 v_y_5))) is different from false [2023-11-24 10:50:17,141 INFO L349 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-11-24 10:50:17,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 227 treesize of output 256 [2023-11-24 10:50:17,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2023-11-24 10:50:17,256 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-24 10:50:17,257 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 2 case distinctions, treesize of input 271 treesize of output 244 [2023-11-24 10:50:17,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:50:17,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 13 [2023-11-24 10:50:17,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2023-11-24 10:50:17,340 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#max~0.base|))) (let ((.cse0 (= |c_thr1Thread3of3ForFork0_findMax_~c~0#1| (select .cse4 |c_~#max~0.offset|)))) (and (let ((.cse1 (let ((.cse3 (store |c_#memory_int| |c_~#max~0.base| (store .cse4 |c_~#max~0.offset| |c_thr1Thread3of3ForFork0_findMax_~e~0#1|)))) (store .cse3 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base| (store (select .cse3 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base|) |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.offset| 1))))) (or (not .cse0) (< (select (select .cse1 |c_~#max~0.base|) |c_~#max~0.offset|) |c_thr1Thread3of3ForFork0_findMax_~e~0#1|) (forall ((v_y_5 Int) (v_prenex_2 (Array Int Int))) (or (< v_y_5 0) (< 2 v_y_5) (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_2))) (< (select (select .cse2 |c_~#storage~0.base|) (+ (* v_y_5 8) |c_~#storage~0.offset|)) (+ (select (select .cse2 |c_~#max~0.base|) |c_~#max~0.offset|) 1))))))) (or .cse0 (forall ((v_y_5 Int) (v_DerPreprocessor_4 (Array Int Int)) (v_ArrVal_2312 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base| v_DerPreprocessor_4))) (or (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2312))) (< (select (select .cse5 |c_~#storage~0.base|) (+ (* v_y_5 8) |c_~#storage~0.offset|)) (+ (select (select .cse5 |c_~#max~0.base|) |c_~#max~0.offset|) 1))) (< v_y_5 0) (< (select (select .cse6 |c_~#max~0.base|) |c_~#max~0.offset|) |c_thr1Thread3of3ForFork0_findMax_~e~0#1|) (< 2 v_y_5) (= (select v_DerPreprocessor_4 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.offset|) 0)))))))) is different from false [2023-11-24 10:50:17,442 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#max~0.base|))) (let ((.cse0 (= |c_thr1Thread3of3ForFork0_findMax_#t~mem9#1| (select .cse4 |c_~#max~0.offset|)))) (and (let ((.cse1 (let ((.cse3 (store |c_#memory_int| |c_~#max~0.base| (store .cse4 |c_~#max~0.offset| |c_thr1Thread3of3ForFork0_findMax_~e~0#1|)))) (store .cse3 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base| (store (select .cse3 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base|) |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.offset| 1))))) (or (not .cse0) (< (select (select .cse1 |c_~#max~0.base|) |c_~#max~0.offset|) |c_thr1Thread3of3ForFork0_findMax_~e~0#1|) (forall ((v_y_5 Int) (v_prenex_2 (Array Int Int))) (or (< v_y_5 0) (< 2 v_y_5) (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_2))) (< (select (select .cse2 |c_~#storage~0.base|) (+ (* v_y_5 8) |c_~#storage~0.offset|)) (+ (select (select .cse2 |c_~#max~0.base|) |c_~#max~0.offset|) 1))))))) (or .cse0 (forall ((v_y_5 Int) (v_DerPreprocessor_4 (Array Int Int)) (v_ArrVal_2312 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base| v_DerPreprocessor_4))) (or (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2312))) (< (select (select .cse5 |c_~#storage~0.base|) (+ (* v_y_5 8) |c_~#storage~0.offset|)) (+ (select (select .cse5 |c_~#max~0.base|) |c_~#max~0.offset|) 1))) (< v_y_5 0) (< (select (select .cse6 |c_~#max~0.base|) |c_~#max~0.offset|) |c_thr1Thread3of3ForFork0_findMax_~e~0#1|) (< 2 v_y_5) (= (select v_DerPreprocessor_4 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.offset|) 0)))))))) is different from false [2023-11-24 10:50:17,759 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#max~0.offset| Int)) (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |c_~#max~0.base| (store (select |c_#memory_int| |c_~#max~0.base|) |~#max~0.offset| |c_thr1Thread3of3ForFork0_findMax_~e~0#1|)))) (store .cse2 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base| (store (select .cse2 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base|) |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.offset| 1))))) (or (forall ((v_y_5 Int) (v_prenex_2 (Array Int Int))) (or (< v_y_5 0) (< 2 v_y_5) (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_2))) (< (select (select .cse0 |c_~#storage~0.base|) (+ (* v_y_5 8) |c_~#storage~0.offset|)) (+ (select (select .cse0 |c_~#max~0.base|) |~#max~0.offset|) 1))))) (< (select (select .cse1 |c_~#max~0.base|) |~#max~0.offset|) |c_thr1Thread3of3ForFork0_findMax_~e~0#1|)))) is different from false [2023-11-24 10:50:17,805 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_y_5 Int) (|~#max~0.offset| Int) (v_prenex_2 (Array Int Int))) (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |c_~#max~0.base| (store (select |c_#memory_int| |c_~#max~0.base|) |~#max~0.offset| |c_thr1Thread3of3ForFork0_findMax_#t~mem8#1|)))) (store .cse2 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base| (store (select .cse2 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base|) |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.offset| 1))))) (or (< v_y_5 0) (< 2 v_y_5) (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_2))) (< (select (select .cse0 |c_~#storage~0.base|) (+ (* v_y_5 8) |c_~#storage~0.offset|)) (+ (select (select .cse0 |c_~#max~0.base|) |~#max~0.offset|) 1))) (< (select (select .cse1 |c_~#max~0.base|) |~#max~0.offset|) |c_thr1Thread3of3ForFork0_findMax_#t~mem8#1|)))) is different from false [2023-11-24 10:50:18,209 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_y_5 Int) (|~#max~0.offset| Int) (v_prenex_2 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_int| |c_~#storage~0.base|) (+ (* |c_thr1Thread3of3ForFork0_findMax_~offset#1| 4) |c_~#storage~0.offset|)))) (let ((.cse1 (let ((.cse3 (store |c_#memory_int| |c_~#max~0.base| (store (select |c_#memory_int| |c_~#max~0.base|) |~#max~0.offset| .cse2)))) (store .cse3 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base| (store (select .cse3 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base|) |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.offset| 1))))) (or (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_2))) (< (select (select .cse0 |c_~#storage~0.base|) (+ (* v_y_5 8) |c_~#storage~0.offset|)) (+ (select (select .cse0 |c_~#max~0.base|) |~#max~0.offset|) 1))) (< v_y_5 0) (< 2 v_y_5) (< (select (select .cse1 |c_~#max~0.base|) |~#max~0.offset|) .cse2))))) is different from false [2023-11-24 10:50:27,402 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-11-24 10:50:27,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 1 [2023-11-24 10:50:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 3 refuted. 2 times theorem prover too weak. 15 trivial. 40 not checked. [2023-11-24 10:50:27,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007177770] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 10:50:27,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 10:50:27,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 39] total 116 [2023-11-24 10:50:27,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665657927] [2023-11-24 10:50:27,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 10:50:27,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2023-11-24 10:50:27,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 10:50:27,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2023-11-24 10:50:27,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=807, Invalid=11141, Unknown=66, NotChecked=1326, Total=13340 [2023-11-24 10:50:27,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:50:27,413 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 10:50:27,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 116 states, 116 states have (on average 4.241379310344827) internal successors, (492), 116 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 10:50:27,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:50:27,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:50:27,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:50:27,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:50:27,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 10:50:27,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2023-11-24 10:50:27,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:54:21,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:54:21,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:54:21,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:54:21,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:54:21,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 10:54:21,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-11-24 10:54:21,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2023-11-24 10:54:21,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-24 10:54:21,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-24 10:54:21,480 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 10:54:21,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 10:54:21,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2033872028, now seen corresponding path program 1 times [2023-11-24 10:54:21,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 10:54:21,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865096036] [2023-11-24 10:54:21,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:54:21,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 10:54:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:54:25,353 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 1 proven. 57 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-24 10:54:25,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 10:54:25,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865096036] [2023-11-24 10:54:25,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865096036] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 10:54:25,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856099248] [2023-11-24 10:54:25,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 10:54:25,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 10:54:25,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 10:54:25,355 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 10:54:25,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-24 10:54:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 10:54:25,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 84 conjunts are in the unsatisfiable core [2023-11-24 10:54:26,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 10:54:26,704 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-24 10:54:26,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2023-11-24 10:54:26,853 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 51 treesize of output 36 [2023-11-24 10:54:27,014 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 51 treesize of output 36 [2023-11-24 10:54:27,171 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 51 treesize of output 36 [2023-11-24 10:54:28,374 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-24 10:54:28,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-24 10:54:29,544 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-24 10:54:29,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 84 [2023-11-24 10:54:29,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 10:54:29,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2023-11-24 10:54:29,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:54:29,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 10 [2023-11-24 10:54:31,679 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 10:54:31,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 64 [2023-11-24 10:54:34,979 INFO L349 Elim1Store]: treesize reduction 42, result has 14.3 percent of original size [2023-11-24 10:54:34,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 23 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 34 [2023-11-24 10:54:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 1 proven. 57 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-24 10:54:34,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 10:54:36,069 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2649 (Array Int Int)) (v_y_9 Int)) (or (< 2 v_y_9) (< v_y_9 0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2649))) (< (select (select .cse0 |c_~#storage~0.base|) (+ (* v_y_9 8) 4 |c_~#storage~0.offset|)) (+ (select (select .cse0 |c_~#max~0.base|) |c_~#max~0.offset|) 1))))) is different from false [2023-11-24 10:54:36,643 INFO L349 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-11-24 10:54:36,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 227 treesize of output 256 [2023-11-24 10:54:36,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2023-11-24 10:54:36,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:54:36,744 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 219 treesize of output 185 [2023-11-24 10:54:36,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2023-11-24 10:54:36,791 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#max~0.base|))) (let ((.cse0 (= |c_thr1Thread3of3ForFork0_findMax_~c~0#1| (select .cse4 |c_~#max~0.offset|)))) (and (or .cse0 (forall ((v_ArrVal_2649 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (|thr1Thread3of3ForFork0_findMax_~#cret~0#1.offset| Int) (v_y_9 Int)) (or (= (select v_DerPreprocessor_7 |thr1Thread3of3ForFork0_findMax_~#cret~0#1.offset|) 0) (< 2 v_y_9) (let ((.cse1 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2649))) (< (select (select .cse1 |c_~#storage~0.base|) (+ (* v_y_9 8) 4 |c_~#storage~0.offset|)) (+ (select (select .cse1 |c_~#max~0.base|) |c_~#max~0.offset|) 1))) (< v_y_9 0)))) (or (not .cse0) (forall ((v_prenex_5 Int) (v_prenex_4 (Array Int Int)) (v_y_9 Int)) (or (< 2 v_y_9) (let ((.cse2 (store (let ((.cse3 (store |c_#memory_int| |c_~#max~0.base| (store .cse4 |c_~#max~0.offset| |c_thr1Thread3of3ForFork0_findMax_~e~0#1|)))) (store .cse3 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base| (store (select .cse3 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base|) v_prenex_5 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_4))) (< (select (select .cse2 |c_~#storage~0.base|) (+ (* v_y_9 8) 4 |c_~#storage~0.offset|)) (+ (select (select .cse2 |c_~#max~0.base|) |c_~#max~0.offset|) 1))) (< v_y_9 0))))))) is different from false [2023-11-24 10:54:36,857 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#max~0.base|))) (let ((.cse0 (= |c_thr1Thread3of3ForFork0_findMax_#t~mem9#1| (select .cse4 |c_~#max~0.offset|)))) (and (or .cse0 (forall ((v_ArrVal_2649 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (|thr1Thread3of3ForFork0_findMax_~#cret~0#1.offset| Int) (v_y_9 Int)) (or (= (select v_DerPreprocessor_7 |thr1Thread3of3ForFork0_findMax_~#cret~0#1.offset|) 0) (< 2 v_y_9) (let ((.cse1 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2649))) (< (select (select .cse1 |c_~#storage~0.base|) (+ (* v_y_9 8) 4 |c_~#storage~0.offset|)) (+ (select (select .cse1 |c_~#max~0.base|) |c_~#max~0.offset|) 1))) (< v_y_9 0)))) (or (not .cse0) (forall ((v_prenex_5 Int) (v_prenex_4 (Array Int Int)) (v_y_9 Int)) (or (< 2 v_y_9) (let ((.cse2 (store (let ((.cse3 (store |c_#memory_int| |c_~#max~0.base| (store .cse4 |c_~#max~0.offset| |c_thr1Thread3of3ForFork0_findMax_~e~0#1|)))) (store .cse3 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base| (store (select .cse3 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base|) v_prenex_5 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_4))) (< (select (select .cse2 |c_~#storage~0.base|) (+ (* v_y_9 8) 4 |c_~#storage~0.offset|)) (+ (select (select .cse2 |c_~#max~0.base|) |c_~#max~0.offset|) 1))) (< v_y_9 0))))))) is different from false [2023-11-24 10:54:36,999 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_prenex_5 Int) (|~#max~0.offset| Int) (v_prenex_4 (Array Int Int)) (v_y_9 Int)) (or (< 2 v_y_9) (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_~#max~0.base| (store (select |c_#memory_int| |c_~#max~0.base|) |~#max~0.offset| |c_thr1Thread3of3ForFork0_findMax_~e~0#1|)))) (store .cse1 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base| (store (select .cse1 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base|) v_prenex_5 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_4))) (< (select (select .cse0 |c_~#storage~0.base|) (+ (* v_y_9 8) 4 |c_~#storage~0.offset|)) (+ (select (select .cse0 |c_~#max~0.base|) |~#max~0.offset|) 1))) (< v_y_9 0))) is different from false [2023-11-24 10:54:37,023 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_prenex_5 Int) (|~#max~0.offset| Int) (v_prenex_4 (Array Int Int)) (v_y_9 Int)) (or (< 2 v_y_9) (< v_y_9 0) (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_~#max~0.base| (store (select |c_#memory_int| |c_~#max~0.base|) |~#max~0.offset| |c_thr1Thread3of3ForFork0_findMax_#t~mem8#1|)))) (store .cse1 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base| (store (select .cse1 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base|) v_prenex_5 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_4))) (< (select (select .cse0 |c_~#storage~0.base|) (+ (* v_y_9 8) 4 |c_~#storage~0.offset|)) (+ (select (select .cse0 |c_~#max~0.base|) |~#max~0.offset|) 1))))) is different from false [2023-11-24 10:54:37,066 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_prenex_5 Int) (|~#max~0.offset| Int) (v_prenex_4 (Array Int Int)) (v_y_9 Int)) (or (< 2 v_y_9) (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_~#max~0.base| (store (select |c_#memory_int| |c_~#max~0.base|) |~#max~0.offset| (select (select |c_#memory_int| |c_~#storage~0.base|) (+ (* |c_thr1Thread3of3ForFork0_findMax_~i~0#1| 4) |c_~#storage~0.offset|)))))) (store .cse1 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base| (store (select .cse1 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base|) v_prenex_5 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_4))) (< (select (select .cse0 |c_~#storage~0.base|) (+ (* v_y_9 8) 4 |c_~#storage~0.offset|)) (+ (select (select .cse0 |c_~#max~0.base|) |~#max~0.offset|) 1))) (< v_y_9 0))) is different from false [2023-11-24 10:54:37,084 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_prenex_5 Int) (|~#max~0.offset| Int) (v_prenex_4 (Array Int Int)) (v_y_9 Int)) (or (< 2 v_y_9) (< v_y_9 0) (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_~#max~0.base| (store (select |c_#memory_int| |c_~#max~0.base|) |~#max~0.offset| (select (select |c_#memory_int| |c_~#storage~0.base|) (+ (* |c_thr1Thread3of3ForFork0_findMax_~offset#1| 4) |c_~#storage~0.offset|)))))) (store .cse1 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base| (store (select .cse1 |c_thr1Thread3of3ForFork0_findMax_~#cret~0#1.base|) v_prenex_5 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_4))) (< (select (select .cse0 |c_~#storage~0.base|) (+ (* v_y_9 8) 4 |c_~#storage~0.offset|)) (+ (select (select .cse0 |c_~#max~0.base|) |~#max~0.offset|) 1))))) is different from false [2023-11-24 10:55:04,439 INFO L349 Elim1Store]: treesize reduction 46, result has 54.0 percent of original size [2023-11-24 10:55:04,441 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 17974 treesize of output 16711 [2023-11-24 10:55:04,593 INFO L349 Elim1Store]: treesize reduction 38, result has 55.3 percent of original size [2023-11-24 10:55:04,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2032 treesize of output 1905 [2023-11-24 10:55:04,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:55:04,673 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 2214 treesize of output 2218 [2023-11-24 10:55:04,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:55:04,794 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 583 treesize of output 586 [2023-11-24 10:55:04,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 10:55:04,892 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 1516 treesize of output 1305 [2023-11-24 10:55:07,057 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 35 treesize of output 28 [2023-11-24 10:55:07,077 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-24 10:55:07,099 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-24 10:55:07,141 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 10:55:07,412 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 10:55:07,425 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 10:55:07,450 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-24 10:55:07,524 INFO L349 Elim1Store]: treesize reduction 40, result has 18.4 percent of original size [2023-11-24 10:55:07,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 3263 treesize of output 2623 [2023-11-24 10:55:09,035 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 1 proven. 22 refuted. 2 times theorem prover too weak. 20 trivial. 35 not checked. [2023-11-24 10:55:09,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856099248] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 10:55:09,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 10:55:09,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 42] total 116 [2023-11-24 10:55:09,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536314929] [2023-11-24 10:55:09,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 10:55:09,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2023-11-24 10:55:09,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 10:55:09,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2023-11-24 10:55:09,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=881, Invalid=10801, Unknown=118, NotChecked=1540, Total=13340 [2023-11-24 10:55:09,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:55:09,041 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 10:55:09,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 116 states, 116 states have (on average 4.767241379310345) internal successors, (553), 116 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 10:55:09,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:55:09,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:55:09,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:55:09,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 10:55:09,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 10:55:09,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2023-11-24 10:55:09,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 199 states. [2023-11-24 10:55:09,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 10:55:27,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 [1] [2023-11-24 10:55:33,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 10:55:35,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 10:55:38,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 10:55:43,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 10:55:45,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 10:55:53,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 10:56:00,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 10:56:03,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 10:56:07,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 10:56:09,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 [1] [2023-11-24 10:56:12,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15