/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_12-arraycollapse_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:35:25,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:35:25,802 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 00:35:25,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:35:25,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:35:25,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:35:25,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:35:25,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:35:25,819 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:35:25,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:35:25,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:35:25,819 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:35:25,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:35:25,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:35:25,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:35:25,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:35:25,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:35:25,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:35:25,821 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:35:25,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:35:25,821 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:35:25,822 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:35:25,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:35:25,822 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:35:25,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:35:25,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:35:25,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:35:25,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:35:25,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:35:25,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:35:25,822 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:35:25,823 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:35:25,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2025-03-15 00:35:26,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:35:26,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:35:26,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:35:26,069 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:35:26,069 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:35:26,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_12-arraycollapse_rc.i [2025-03-15 00:35:27,171 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c21d2289b/2e3948eae8524feb9e94862d105ab090/FLAGf3da73c71 [2025-03-15 00:35:27,431 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:35:27,431 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_12-arraycollapse_rc.i [2025-03-15 00:35:27,451 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c21d2289b/2e3948eae8524feb9e94862d105ab090/FLAGf3da73c71 [2025-03-15 00:35:27,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c21d2289b/2e3948eae8524feb9e94862d105ab090 [2025-03-15 00:35:27,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:35:27,742 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:35:27,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:35:27,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:35:27,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:35:27,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:35:27" (1/1) ... [2025-03-15 00:35:27,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cebaf1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:35:27, skipping insertion in model container [2025-03-15 00:35:27,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:35:27" (1/1) ... [2025-03-15 00:35:27,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:35:28,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:35:28,089 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:35:28,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:35:28,204 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:35:28,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:35:28 WrapperNode [2025-03-15 00:35:28,206 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:35:28,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:35:28,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:35:28,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:35:28,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:35:28" (1/1) ... [2025-03-15 00:35:28,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:35:28" (1/1) ... [2025-03-15 00:35:28,293 INFO L138 Inliner]: procedures = 372, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 389 [2025-03-15 00:35:28,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:35:28,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:35:28,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:35:28,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:35:28,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:35:28" (1/1) ... [2025-03-15 00:35:28,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:35:28" (1/1) ... [2025-03-15 00:35:28,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:35:28" (1/1) ... [2025-03-15 00:35:28,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:35:28" (1/1) ... [2025-03-15 00:35:28,335 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:35:28" (1/1) ... [2025-03-15 00:35:28,337 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:35:28" (1/1) ... [2025-03-15 00:35:28,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:35:28" (1/1) ... [2025-03-15 00:35:28,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:35:28" (1/1) ... [2025-03-15 00:35:28,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:35:28" (1/1) ... [2025-03-15 00:35:28,356 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:35:28,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:35:28,357 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:35:28,357 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:35:28,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:35:28" (1/1) ... [2025-03-15 00:35:28,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:35:28,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:35:28,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 00:35:28,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 00:35:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-15 00:35:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-15 00:35:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:35:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:35:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:35:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:35:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 00:35:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:35:28,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-15 00:35:28,413 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 00:35:28,413 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 00:35:28,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:35:28,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:35:28,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:35:28,414 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 00:35:28,522 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:35:28,524 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:35:29,152 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:35:29,153 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:35:29,174 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:35:29,174 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:35:29,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:35:29 BoogieIcfgContainer [2025-03-15 00:35:29,175 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:35:29,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:35:29,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:35:29,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:35:29,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:35:27" (1/3) ... [2025-03-15 00:35:29,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469c126f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:35:29, skipping insertion in model container [2025-03-15 00:35:29,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:35:28" (2/3) ... [2025-03-15 00:35:29,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469c126f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:35:29, skipping insertion in model container [2025-03-15 00:35:29,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:35:29" (3/3) ... [2025-03-15 00:35:29,184 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_12-arraycollapse_rc.i [2025-03-15 00:35:29,197 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:35:29,200 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_12-arraycollapse_rc.i that has 2 procedures, 454 locations, 1 initial locations, 1 loop locations, and 28 error locations. [2025-03-15 00:35:29,200 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:35:29,304 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 00:35:29,342 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:35:29,351 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@302dcfae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:35:29,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-03-15 00:35:29,392 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:35:29,392 INFO L124 PetriNetUnfolderBase]: 1/101 cut-off events. [2025-03-15 00:35:29,396 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:35:29,397 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:29,397 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:35:29,397 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-15 00:35:29,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:29,401 INFO L85 PathProgramCache]: Analyzing trace with hash 351475653, now seen corresponding path program 1 times [2025-03-15 00:35:29,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:29,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862626053] [2025-03-15 00:35:29,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:35:29,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:35:30,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:35:30,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:30,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862626053] [2025-03-15 00:35:30,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862626053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:35:30,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:35:30,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:35:30,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299088368] [2025-03-15 00:35:30,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:35:30,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:35:30,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:30,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:35:30,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:35:30,229 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 457 [2025-03-15 00:35:30,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 457 transitions, 918 flow. Second operand has 6 states, 6 states have (on average 258.5) internal successors, (1551), 6 states have internal predecessors, (1551), 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) [2025-03-15 00:35:30,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:30,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 457 [2025-03-15 00:35:30,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:31,042 INFO L124 PetriNetUnfolderBase]: 761/2594 cut-off events. [2025-03-15 00:35:31,043 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 00:35:31,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4313 conditions, 2594 events. 761/2594 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 14168 event pairs, 760 based on Foata normal form. 18/2326 useless extension candidates. Maximal degree in co-relation 3848. Up to 1700 conditions per place. [2025-03-15 00:35:31,066 INFO L140 encePairwiseOnDemand]: 436/457 looper letters, 179 selfloop transitions, 15 changer transitions 2/450 dead transitions. [2025-03-15 00:35:31,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 450 transitions, 1291 flow [2025-03-15 00:35:31,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:35:31,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:35:31,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1742 transitions. [2025-03-15 00:35:31,084 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6353026987600292 [2025-03-15 00:35:31,086 INFO L298 CegarLoopForPetriNet]: 457 programPoint places, 1 predicate places. [2025-03-15 00:35:31,086 INFO L471 AbstractCegarLoop]: Abstraction has has 458 places, 450 transitions, 1291 flow [2025-03-15 00:35:31,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 258.5) internal successors, (1551), 6 states have internal predecessors, (1551), 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) [2025-03-15 00:35:31,087 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:31,087 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:35:31,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:35:31,088 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-15 00:35:31,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:31,089 INFO L85 PathProgramCache]: Analyzing trace with hash -584403533, now seen corresponding path program 1 times [2025-03-15 00:35:31,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:31,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062386593] [2025-03-15 00:35:31,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:35:31,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:35:31,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:35:31,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:31,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062386593] [2025-03-15 00:35:31,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062386593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:35:31,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:35:31,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:35:31,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859433930] [2025-03-15 00:35:31,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:35:31,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:35:31,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:31,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:35:31,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:35:31,531 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 457 [2025-03-15 00:35:31,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 450 transitions, 1291 flow. Second operand has 6 states, 6 states have (on average 259.5) internal successors, (1557), 6 states have internal predecessors, (1557), 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) [2025-03-15 00:35:31,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:31,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 457 [2025-03-15 00:35:31,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:32,192 INFO L124 PetriNetUnfolderBase]: 761/2591 cut-off events. [2025-03-15 00:35:32,192 INFO L125 PetriNetUnfolderBase]: For 194/350 co-relation queries the response was YES. [2025-03-15 00:35:32,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6019 conditions, 2591 events. 761/2591 cut-off events. For 194/350 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 14166 event pairs, 760 based on Foata normal form. 0/2308 useless extension candidates. Maximal degree in co-relation 5426. Up to 1697 conditions per place. [2025-03-15 00:35:32,201 INFO L140 encePairwiseOnDemand]: 439/457 looper letters, 176 selfloop transitions, 15 changer transitions 2/447 dead transitions. [2025-03-15 00:35:32,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 447 transitions, 1661 flow [2025-03-15 00:35:32,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:35:32,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:35:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1736 transitions. [2025-03-15 00:35:32,205 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6331145149525893 [2025-03-15 00:35:32,205 INFO L298 CegarLoopForPetriNet]: 457 programPoint places, 3 predicate places. [2025-03-15 00:35:32,205 INFO L471 AbstractCegarLoop]: Abstraction has has 460 places, 447 transitions, 1661 flow [2025-03-15 00:35:32,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 259.5) internal successors, (1557), 6 states have internal predecessors, (1557), 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) [2025-03-15 00:35:32,206 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:32,206 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:35:32,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:35:32,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-15 00:35:32,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:32,207 INFO L85 PathProgramCache]: Analyzing trace with hash 393969553, now seen corresponding path program 1 times [2025-03-15 00:35:32,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:32,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384603793] [2025-03-15 00:35:32,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:35:32,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:35:32,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:35:32,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:32,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384603793] [2025-03-15 00:35:32,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384603793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:35:32,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:35:32,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:35:32,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287910823] [2025-03-15 00:35:32,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:35:32,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:35:32,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:32,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:35:32,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:35:32,657 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 457 [2025-03-15 00:35:32,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 447 transitions, 1661 flow. Second operand has 6 states, 6 states have (on average 258.3333333333333) internal successors, (1550), 6 states have internal predecessors, (1550), 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) [2025-03-15 00:35:32,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:32,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 457 [2025-03-15 00:35:32,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:33,344 INFO L124 PetriNetUnfolderBase]: 859/2816 cut-off events. [2025-03-15 00:35:33,344 INFO L125 PetriNetUnfolderBase]: For 609/945 co-relation queries the response was YES. [2025-03-15 00:35:33,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8345 conditions, 2816 events. 859/2816 cut-off events. For 609/945 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15846 event pairs, 858 based on Foata normal form. 0/2515 useless extension candidates. Maximal degree in co-relation 7621. Up to 1906 conditions per place. [2025-03-15 00:35:33,360 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 189 selfloop transitions, 5 changer transitions 2/446 dead transitions. [2025-03-15 00:35:33,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 446 transitions, 2043 flow [2025-03-15 00:35:33,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:35:33,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:35:33,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1713 transitions. [2025-03-15 00:35:33,364 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.62472647702407 [2025-03-15 00:35:33,365 INFO L298 CegarLoopForPetriNet]: 457 programPoint places, 7 predicate places. [2025-03-15 00:35:33,365 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 446 transitions, 2043 flow [2025-03-15 00:35:33,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 258.3333333333333) internal successors, (1550), 6 states have internal predecessors, (1550), 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) [2025-03-15 00:35:33,366 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:33,366 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:35:33,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:35:33,366 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-15 00:35:33,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:33,367 INFO L85 PathProgramCache]: Analyzing trace with hash 816020147, now seen corresponding path program 1 times [2025-03-15 00:35:33,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:33,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438046318] [2025-03-15 00:35:33,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:35:33,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:35:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:35:33,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:33,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438046318] [2025-03-15 00:35:33,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438046318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:35:33,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:35:33,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:35:33,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560348536] [2025-03-15 00:35:33,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:35:33,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:35:33,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:33,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:35:33,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:35:33,473 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 457 [2025-03-15 00:35:33,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 446 transitions, 2043 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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) [2025-03-15 00:35:33,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:33,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 457 [2025-03-15 00:35:33,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:33,945 INFO L124 PetriNetUnfolderBase]: 859/2925 cut-off events. [2025-03-15 00:35:33,945 INFO L125 PetriNetUnfolderBase]: For 1014/1359 co-relation queries the response was YES. [2025-03-15 00:35:33,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8847 conditions, 2925 events. 859/2925 cut-off events. For 1014/1359 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15874 event pairs, 858 based on Foata normal form. 0/2620 useless extension candidates. Maximal degree in co-relation 7787. Up to 1958 conditions per place. [2025-03-15 00:35:33,956 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 42 selfloop transitions, 2 changer transitions 2/463 dead transitions. [2025-03-15 00:35:33,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 463 transitions, 2243 flow [2025-03-15 00:35:33,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:35:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:35:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1323 transitions. [2025-03-15 00:35:33,959 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9649890590809628 [2025-03-15 00:35:33,959 INFO L298 CegarLoopForPetriNet]: 457 programPoint places, 9 predicate places. [2025-03-15 00:35:33,959 INFO L471 AbstractCegarLoop]: Abstraction has has 466 places, 463 transitions, 2243 flow [2025-03-15 00:35:33,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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) [2025-03-15 00:35:33,960 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:33,960 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:35:33,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:35:33,960 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-15 00:35:33,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:33,961 INFO L85 PathProgramCache]: Analyzing trace with hash -503993896, now seen corresponding path program 1 times [2025-03-15 00:35:33,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:33,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927819905] [2025-03-15 00:35:33,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:35:33,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:35:34,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:35:34,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:34,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927819905] [2025-03-15 00:35:34,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927819905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:35:34,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:35:34,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:35:34,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016668905] [2025-03-15 00:35:34,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:35:34,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:35:34,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:34,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:35:34,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:35:34,487 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 457 [2025-03-15 00:35:34,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 463 transitions, 2243 flow. Second operand has 6 states, 6 states have (on average 262.8333333333333) internal successors, (1577), 6 states have internal predecessors, (1577), 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) [2025-03-15 00:35:34,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:34,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 457 [2025-03-15 00:35:34,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:35,347 INFO L124 PetriNetUnfolderBase]: 859/2923 cut-off events. [2025-03-15 00:35:35,347 INFO L125 PetriNetUnfolderBase]: For 1522/2065 co-relation queries the response was YES. [2025-03-15 00:35:35,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10799 conditions, 2923 events. 859/2923 cut-off events. For 1522/2065 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15839 event pairs, 858 based on Foata normal form. 0/2620 useless extension candidates. Maximal degree in co-relation 9564. Up to 1956 conditions per place. [2025-03-15 00:35:35,364 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 198 selfloop transitions, 9 changer transitions 2/461 dead transitions. [2025-03-15 00:35:35,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 461 transitions, 2637 flow [2025-03-15 00:35:35,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:35:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:35:35,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1722 transitions. [2025-03-15 00:35:35,368 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6280087527352297 [2025-03-15 00:35:35,371 INFO L298 CegarLoopForPetriNet]: 457 programPoint places, 13 predicate places. [2025-03-15 00:35:35,372 INFO L471 AbstractCegarLoop]: Abstraction has has 470 places, 461 transitions, 2637 flow [2025-03-15 00:35:35,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 262.8333333333333) internal successors, (1577), 6 states have internal predecessors, (1577), 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) [2025-03-15 00:35:35,372 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:35,373 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:35:35,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:35:35,373 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-15 00:35:35,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:35,374 INFO L85 PathProgramCache]: Analyzing trace with hash -996390395, now seen corresponding path program 1 times [2025-03-15 00:35:35,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:35,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563245488] [2025-03-15 00:35:35,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:35:35,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:35:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:35:35,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:35,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563245488] [2025-03-15 00:35:35,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563245488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:35:35,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:35:35,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:35:35,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131259931] [2025-03-15 00:35:35,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:35:35,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:35:35,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:35,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:35:35,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:35:35,870 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 457 [2025-03-15 00:35:35,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 461 transitions, 2637 flow. Second operand has 6 states, 6 states have (on average 272.3333333333333) internal successors, (1634), 6 states have internal predecessors, (1634), 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) [2025-03-15 00:35:35,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:35,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 457 [2025-03-15 00:35:35,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:36,509 INFO L124 PetriNetUnfolderBase]: 859/2919 cut-off events. [2025-03-15 00:35:36,510 INFO L125 PetriNetUnfolderBase]: For 2386/3097 co-relation queries the response was YES. [2025-03-15 00:35:36,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12625 conditions, 2919 events. 859/2919 cut-off events. For 2386/3097 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15836 event pairs, 858 based on Foata normal form. 0/2620 useless extension candidates. Maximal degree in co-relation 11238. Up to 1952 conditions per place. [2025-03-15 00:35:36,526 INFO L140 encePairwiseOnDemand]: 439/457 looper letters, 172 selfloop transitions, 15 changer transitions 2/458 dead transitions. [2025-03-15 00:35:36,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 458 transitions, 2981 flow [2025-03-15 00:35:36,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:35:36,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:35:36,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1776 transitions. [2025-03-15 00:35:36,529 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6477024070021882 [2025-03-15 00:35:36,529 INFO L298 CegarLoopForPetriNet]: 457 programPoint places, 15 predicate places. [2025-03-15 00:35:36,529 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 458 transitions, 2981 flow [2025-03-15 00:35:36,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 272.3333333333333) internal successors, (1634), 6 states have internal predecessors, (1634), 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) [2025-03-15 00:35:36,530 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:36,530 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:35:36,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:35:36,530 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-15 00:35:36,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:36,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1798206450, now seen corresponding path program 1 times [2025-03-15 00:35:36,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:36,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642339372] [2025-03-15 00:35:36,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:35:36,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:35:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:35:36,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:36,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642339372] [2025-03-15 00:35:36,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642339372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:35:36,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:35:36,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:35:36,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251398024] [2025-03-15 00:35:36,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:35:36,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:35:36,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:36,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:35:36,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:35:36,864 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 457 [2025-03-15 00:35:36,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 458 transitions, 2981 flow. Second operand has 6 states, 6 states have (on average 267.5) internal successors, (1605), 6 states have internal predecessors, (1605), 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) [2025-03-15 00:35:36,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:36,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 457 [2025-03-15 00:35:36,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:37,600 INFO L124 PetriNetUnfolderBase]: 859/2915 cut-off events. [2025-03-15 00:35:37,600 INFO L125 PetriNetUnfolderBase]: For 3471/4336 co-relation queries the response was YES. [2025-03-15 00:35:37,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14451 conditions, 2915 events. 859/2915 cut-off events. For 3471/4336 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15830 event pairs, 858 based on Foata normal form. 0/2620 useless extension candidates. Maximal degree in co-relation 12912. Up to 1948 conditions per place. [2025-03-15 00:35:37,611 INFO L140 encePairwiseOnDemand]: 439/457 looper letters, 175 selfloop transitions, 15 changer transitions 2/455 dead transitions. [2025-03-15 00:35:37,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 455 transitions, 3325 flow [2025-03-15 00:35:37,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:35:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:35:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1743 transitions. [2025-03-15 00:35:37,615 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6356673960612691 [2025-03-15 00:35:37,616 INFO L298 CegarLoopForPetriNet]: 457 programPoint places, 17 predicate places. [2025-03-15 00:35:37,616 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 455 transitions, 3325 flow [2025-03-15 00:35:37,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 267.5) internal successors, (1605), 6 states have internal predecessors, (1605), 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) [2025-03-15 00:35:37,618 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:37,618 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:35:37,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:35:37,618 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-15 00:35:37,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:37,619 INFO L85 PathProgramCache]: Analyzing trace with hash 516346251, now seen corresponding path program 1 times [2025-03-15 00:35:37,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:37,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302202993] [2025-03-15 00:35:37,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:35:37,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:35:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:35:37,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:37,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302202993] [2025-03-15 00:35:37,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302202993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:35:37,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:35:37,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:35:37,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128189323] [2025-03-15 00:35:37,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:35:37,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:35:37,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:37,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:35:37,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:35:37,943 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 457 [2025-03-15 00:35:37,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 455 transitions, 3325 flow. Second operand has 6 states, 6 states have (on average 268.3333333333333) internal successors, (1610), 6 states have internal predecessors, (1610), 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) [2025-03-15 00:35:37,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:37,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 457 [2025-03-15 00:35:37,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:38,747 INFO L124 PetriNetUnfolderBase]: 859/2911 cut-off events. [2025-03-15 00:35:38,748 INFO L125 PetriNetUnfolderBase]: For 4789/5808 co-relation queries the response was YES. [2025-03-15 00:35:38,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16269 conditions, 2911 events. 859/2911 cut-off events. For 4789/5808 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15811 event pairs, 858 based on Foata normal form. 0/2620 useless extension candidates. Maximal degree in co-relation 14586. Up to 1944 conditions per place. [2025-03-15 00:35:38,764 INFO L140 encePairwiseOnDemand]: 439/457 looper letters, 172 selfloop transitions, 15 changer transitions 2/452 dead transitions. [2025-03-15 00:35:38,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 452 transitions, 3657 flow [2025-03-15 00:35:38,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:35:38,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:35:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1740 transitions. [2025-03-15 00:35:38,768 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6345733041575492 [2025-03-15 00:35:38,768 INFO L298 CegarLoopForPetriNet]: 457 programPoint places, 19 predicate places. [2025-03-15 00:35:38,768 INFO L471 AbstractCegarLoop]: Abstraction has has 476 places, 452 transitions, 3657 flow [2025-03-15 00:35:38,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 268.3333333333333) internal successors, (1610), 6 states have internal predecessors, (1610), 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) [2025-03-15 00:35:38,769 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:38,769 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:35:38,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:35:38,769 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-15 00:35:38,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash -660004409, now seen corresponding path program 1 times [2025-03-15 00:35:38,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:38,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000350681] [2025-03-15 00:35:38,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:35:38,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:35:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:35:38,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:38,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000350681] [2025-03-15 00:35:38,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000350681] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:35:38,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041310972] [2025-03-15 00:35:38,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:35:38,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:35:38,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:35:38,977 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:35:38,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-15 00:35:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:35:39,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 00:35:39,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:35:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:35:39,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:35:39,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:35:39,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041310972] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:35:39,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:35:39,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-15 00:35:39,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365993570] [2025-03-15 00:35:39,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:35:39,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:35:39,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:39,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:35:39,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-15 00:35:39,524 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 457 [2025-03-15 00:35:39,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 452 transitions, 3657 flow. Second operand has 10 states, 10 states have (on average 430.7) internal successors, (4307), 10 states have internal predecessors, (4307), 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) [2025-03-15 00:35:39,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:39,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 457 [2025-03-15 00:35:39,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:40,352 INFO L124 PetriNetUnfolderBase]: 859/3019 cut-off events. [2025-03-15 00:35:40,352 INFO L125 PetriNetUnfolderBase]: For 5960/6987 co-relation queries the response was YES. [2025-03-15 00:35:40,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17000 conditions, 3019 events. 859/3019 cut-off events. For 5960/6987 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15631 event pairs, 858 based on Foata normal form. 0/2728 useless extension candidates. Maximal degree in co-relation 14752. Up to 1993 conditions per place. [2025-03-15 00:35:40,364 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 53 selfloop transitions, 9 changer transitions 2/471 dead transitions. [2025-03-15 00:35:40,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 471 transitions, 4021 flow [2025-03-15 00:35:40,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:35:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:35:40,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3889 transitions. [2025-03-15 00:35:40,368 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9455385363481643 [2025-03-15 00:35:40,369 INFO L298 CegarLoopForPetriNet]: 457 programPoint places, 27 predicate places. [2025-03-15 00:35:40,369 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 471 transitions, 4021 flow [2025-03-15 00:35:40,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 430.7) internal successors, (4307), 10 states have internal predecessors, (4307), 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) [2025-03-15 00:35:40,370 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:40,370 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:35:40,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-15 00:35:40,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:35:40,571 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-15 00:35:40,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:40,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1918338287, now seen corresponding path program 2 times [2025-03-15 00:35:40,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:40,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271590952] [2025-03-15 00:35:40,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:35:40,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:40,635 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:35:40,636 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:35:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2025-03-15 00:35:40,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:40,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271590952] [2025-03-15 00:35:40,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271590952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:35:40,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:35:40,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:35:40,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928861708] [2025-03-15 00:35:40,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:35:40,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:35:40,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:40,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:35:40,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:35:40,867 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 457 [2025-03-15 00:35:40,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 471 transitions, 4021 flow. Second operand has 6 states, 6 states have (on average 272.8333333333333) internal successors, (1637), 6 states have internal predecessors, (1637), 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) [2025-03-15 00:35:40,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:40,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 457 [2025-03-15 00:35:40,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:42,623 INFO L124 PetriNetUnfolderBase]: 1523/4785 cut-off events. [2025-03-15 00:35:42,624 INFO L125 PetriNetUnfolderBase]: For 11537/13238 co-relation queries the response was YES. [2025-03-15 00:35:42,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31420 conditions, 4785 events. 1523/4785 cut-off events. For 11537/13238 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 30886 event pairs, 115 based on Foata normal form. 0/4324 useless extension candidates. Maximal degree in co-relation 28970. Up to 3338 conditions per place. [2025-03-15 00:35:42,646 INFO L140 encePairwiseOnDemand]: 428/457 looper letters, 299 selfloop transitions, 75 changer transitions 2/644 dead transitions. [2025-03-15 00:35:42,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 644 transitions, 7527 flow [2025-03-15 00:35:42,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:35:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:35:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1912 transitions. [2025-03-15 00:35:42,649 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6973012399708242 [2025-03-15 00:35:42,649 INFO L298 CegarLoopForPetriNet]: 457 programPoint places, 31 predicate places. [2025-03-15 00:35:42,649 INFO L471 AbstractCegarLoop]: Abstraction has has 488 places, 644 transitions, 7527 flow [2025-03-15 00:35:42,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 272.8333333333333) internal successors, (1637), 6 states have internal predecessors, (1637), 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) [2025-03-15 00:35:42,650 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:42,650 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:35:42,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:35:42,650 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-15 00:35:42,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:42,651 INFO L85 PathProgramCache]: Analyzing trace with hash -642922690, now seen corresponding path program 1 times [2025-03-15 00:35:42,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:42,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512148127] [2025-03-15 00:35:42,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:35:42,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:35:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:35:43,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:43,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512148127] [2025-03-15 00:35:43,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512148127] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:35:43,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789613668] [2025-03-15 00:35:43,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:35:43,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:35:43,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:35:43,069 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:35:43,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-15 00:35:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:35:43,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 1764 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-15 00:35:43,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:35:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:35:43,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:35:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:35:44,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789613668] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:35:44,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:35:44,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-15 00:35:44,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735072739] [2025-03-15 00:35:44,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:35:44,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-15 00:35:44,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:44,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-15 00:35:44,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-15 00:35:44,088 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 457 [2025-03-15 00:35:44,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 644 transitions, 7527 flow. Second operand has 18 states, 18 states have (on average 431.94444444444446) internal successors, (7775), 18 states have internal predecessors, (7775), 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) [2025-03-15 00:35:44,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:44,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 457 [2025-03-15 00:35:44,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:46,125 INFO L124 PetriNetUnfolderBase]: 1523/5199 cut-off events. [2025-03-15 00:35:46,125 INFO L125 PetriNetUnfolderBase]: For 14496/16219 co-relation queries the response was YES. [2025-03-15 00:35:46,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34059 conditions, 5199 events. 1523/5199 cut-off events. For 14496/16219 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 30788 event pairs, 115 based on Foata normal form. 0/4738 useless extension candidates. Maximal degree in co-relation 29219. Up to 3530 conditions per place. [2025-03-15 00:35:46,145 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 119 selfloop transitions, 21 changer transitions 2/712 dead transitions. [2025-03-15 00:35:46,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 712 transitions, 8959 flow [2025-03-15 00:35:46,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-15 00:35:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-15 00:35:46,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 9059 transitions. [2025-03-15 00:35:46,153 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9439408148379702 [2025-03-15 00:35:46,153 INFO L298 CegarLoopForPetriNet]: 457 programPoint places, 51 predicate places. [2025-03-15 00:35:46,153 INFO L471 AbstractCegarLoop]: Abstraction has has 508 places, 712 transitions, 8959 flow [2025-03-15 00:35:46,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 431.94444444444446) internal successors, (7775), 18 states have internal predecessors, (7775), 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) [2025-03-15 00:35:46,155 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:46,156 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:35:46,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-15 00:35:46,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-15 00:35:46,356 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-15 00:35:46,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:46,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1413668590, now seen corresponding path program 2 times [2025-03-15 00:35:46,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:46,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107275472] [2025-03-15 00:35:46,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:35:46,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:46,460 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:35:46,460 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:35:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2233 trivial. 0 not checked. [2025-03-15 00:35:46,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:46,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107275472] [2025-03-15 00:35:46,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107275472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:35:46,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:35:46,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:35:46,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127754202] [2025-03-15 00:35:46,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:35:46,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:35:46,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:46,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:35:46,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:35:46,728 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 457 [2025-03-15 00:35:46,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 712 transitions, 8959 flow. Second operand has 6 states, 6 states have (on average 276.3333333333333) internal successors, (1658), 6 states have internal predecessors, (1658), 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) [2025-03-15 00:35:46,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:46,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 457 [2025-03-15 00:35:46,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:49,008 INFO L124 PetriNetUnfolderBase]: 1523/5188 cut-off events. [2025-03-15 00:35:49,009 INFO L125 PetriNetUnfolderBase]: For 17442/19640 co-relation queries the response was YES. [2025-03-15 00:35:49,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37560 conditions, 5188 events. 1523/5188 cut-off events. For 17442/19640 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 30807 event pairs, 115 based on Foata normal form. 0/4728 useless extension candidates. Maximal degree in co-relation 32332. Up to 3529 conditions per place. [2025-03-15 00:35:49,035 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 416 selfloop transitions, 5 changer transitions 2/711 dead transitions. [2025-03-15 00:35:49,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 711 transitions, 9783 flow [2025-03-15 00:35:49,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:35:49,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:35:49,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1736 transitions. [2025-03-15 00:35:49,039 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6331145149525893 [2025-03-15 00:35:49,039 INFO L298 CegarLoopForPetriNet]: 457 programPoint places, 55 predicate places. [2025-03-15 00:35:49,039 INFO L471 AbstractCegarLoop]: Abstraction has has 512 places, 711 transitions, 9783 flow [2025-03-15 00:35:49,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 276.3333333333333) internal successors, (1658), 6 states have internal predecessors, (1658), 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) [2025-03-15 00:35:49,040 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:49,040 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:35:49,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:35:49,040 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-15 00:35:49,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:49,042 INFO L85 PathProgramCache]: Analyzing trace with hash 340710746, now seen corresponding path program 1 times [2025-03-15 00:35:49,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:49,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402078992] [2025-03-15 00:35:49,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:35:49,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:35:50,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:35:50,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:50,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402078992] [2025-03-15 00:35:50,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402078992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:35:50,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387379011] [2025-03-15 00:35:50,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:35:50,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:35:50,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:35:50,297 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:35:50,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-15 00:35:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:35:50,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 3674 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-15 00:35:50,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:35:51,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:35:51,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:35:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:35:52,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387379011] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:35:52,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:35:52,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-15 00:35:52,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649663589] [2025-03-15 00:35:52,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:35:52,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-15 00:35:52,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:52,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-15 00:35:52,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-15 00:35:52,091 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 457 [2025-03-15 00:35:52,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 711 transitions, 9783 flow. Second operand has 23 states, 23 states have (on average 432.7391304347826) internal successors, (9953), 23 states have internal predecessors, (9953), 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) [2025-03-15 00:35:52,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:52,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 457 [2025-03-15 00:35:52,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:54,752 INFO L124 PetriNetUnfolderBase]: 1523/5506 cut-off events. [2025-03-15 00:35:54,753 INFO L125 PetriNetUnfolderBase]: For 21144/23244 co-relation queries the response was YES. [2025-03-15 00:35:54,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39886 conditions, 5506 events. 1523/5506 cut-off events. For 21144/23244 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 30769 event pairs, 129 based on Foata normal form. 0/5046 useless extension candidates. Maximal degree in co-relation 32591. Up to 3673 conditions per place. [2025-03-15 00:35:54,781 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 161 selfloop transitions, 30 changer transitions 2/762 dead transitions. [2025-03-15 00:35:54,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 762 transitions, 11203 flow [2025-03-15 00:35:54,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-15 00:35:54,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-15 00:35:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 12934 transitions. [2025-03-15 00:35:54,790 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9433989788475565 [2025-03-15 00:35:54,790 INFO L298 CegarLoopForPetriNet]: 457 programPoint places, 84 predicate places. [2025-03-15 00:35:54,790 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 762 transitions, 11203 flow [2025-03-15 00:35:54,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 432.7391304347826) internal successors, (9953), 23 states have internal predecessors, (9953), 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) [2025-03-15 00:35:54,793 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:54,793 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:35:54,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-15 00:35:54,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:35:54,994 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-15 00:35:54,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:54,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1123147414, now seen corresponding path program 2 times [2025-03-15 00:35:54,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:54,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100819492] [2025-03-15 00:35:54,997 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:35:54,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:55,132 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:35:55,133 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:35:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4780 trivial. 0 not checked. [2025-03-15 00:35:55,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:55,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100819492] [2025-03-15 00:35:55,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100819492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:35:55,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:35:55,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:35:55,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751528176] [2025-03-15 00:35:55,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:35:55,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:35:55,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:55,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:35:55,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:35:55,447 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 457 [2025-03-15 00:35:55,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 762 transitions, 11203 flow. Second operand has 6 states, 6 states have (on average 294.3333333333333) internal successors, (1766), 6 states have internal predecessors, (1766), 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) [2025-03-15 00:35:55,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:55,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 457 [2025-03-15 00:35:55,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:58,779 INFO L124 PetriNetUnfolderBase]: 1817/6112 cut-off events. [2025-03-15 00:35:58,779 INFO L125 PetriNetUnfolderBase]: For 29609/33728 co-relation queries the response was YES. [2025-03-15 00:35:58,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48349 conditions, 6112 events. 1817/6112 cut-off events. For 29609/33728 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 35273 event pairs, 194 based on Foata normal form. 4/5643 useless extension candidates. Maximal degree in co-relation 40551. Up to 4081 conditions per place. [2025-03-15 00:35:58,810 INFO L140 encePairwiseOnDemand]: 434/457 looper letters, 585 selfloop transitions, 134 changer transitions 2/1062 dead transitions. [2025-03-15 00:35:58,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 1062 transitions, 18719 flow [2025-03-15 00:35:58,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:35:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:35:58,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1973 transitions. [2025-03-15 00:35:58,812 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7195477753464624 [2025-03-15 00:35:58,812 INFO L298 CegarLoopForPetriNet]: 457 programPoint places, 89 predicate places. [2025-03-15 00:35:58,812 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 1062 transitions, 18719 flow [2025-03-15 00:35:58,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 294.3333333333333) internal successors, (1766), 6 states have internal predecessors, (1766), 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) [2025-03-15 00:35:58,813 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:58,813 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:35:58,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 00:35:58,813 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-15 00:35:58,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:58,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1151265894, now seen corresponding path program 1 times [2025-03-15 00:35:58,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:58,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412306844] [2025-03-15 00:35:58,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:35:58,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:36:01,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4780 trivial. 0 not checked. [2025-03-15 00:36:01,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:01,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412306844] [2025-03-15 00:36:01,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412306844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:36:01,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:36:01,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:36:01,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927996539] [2025-03-15 00:36:01,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:36:01,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:36:01,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:01,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:36:01,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:36:01,795 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 457 [2025-03-15 00:36:01,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 1062 transitions, 18719 flow. Second operand has 6 states, 6 states have (on average 292.8333333333333) internal successors, (1757), 6 states have internal predecessors, (1757), 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) [2025-03-15 00:36:01,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:01,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 457 [2025-03-15 00:36:01,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:05,894 INFO L124 PetriNetUnfolderBase]: 2184/6967 cut-off events. [2025-03-15 00:36:05,895 INFO L125 PetriNetUnfolderBase]: For 50962/57978 co-relation queries the response was YES. [2025-03-15 00:36:05,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59583 conditions, 6967 events. 2184/6967 cut-off events. For 50962/57978 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 42271 event pairs, 320 based on Foata normal form. 48/6500 useless extension candidates. Maximal degree in co-relation 51278. Up to 4638 conditions per place. [2025-03-15 00:36:05,935 INFO L140 encePairwiseOnDemand]: 434/457 looper letters, 847 selfloop transitions, 135 changer transitions 43/1363 dead transitions. [2025-03-15 00:36:05,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 1363 transitions, 27487 flow [2025-03-15 00:36:05,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:36:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:36:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1959 transitions. [2025-03-15 00:36:05,937 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7144420131291028 [2025-03-15 00:36:05,937 INFO L298 CegarLoopForPetriNet]: 457 programPoint places, 94 predicate places. [2025-03-15 00:36:05,937 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 1363 transitions, 27487 flow [2025-03-15 00:36:05,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 292.8333333333333) internal successors, (1757), 6 states have internal predecessors, (1757), 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) [2025-03-15 00:36:05,938 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:05,938 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:36:05,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 00:36:05,938 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-15 00:36:05,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:05,940 INFO L85 PathProgramCache]: Analyzing trace with hash -552143584, now seen corresponding path program 1 times [2025-03-15 00:36:05,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:05,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416186989] [2025-03-15 00:36:05,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:36:05,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:36:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4780 trivial. 0 not checked. [2025-03-15 00:36:08,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:08,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416186989] [2025-03-15 00:36:08,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416186989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:36:08,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:36:08,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:36:08,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735815605] [2025-03-15 00:36:08,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:36:08,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:36:08,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:08,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:36:08,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:36:08,771 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 457 [2025-03-15 00:36:08,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 1363 transitions, 27487 flow. Second operand has 6 states, 6 states have (on average 290.6666666666667) internal successors, (1744), 6 states have internal predecessors, (1744), 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) [2025-03-15 00:36:08,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:08,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 457 [2025-03-15 00:36:08,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:13,771 INFO L124 PetriNetUnfolderBase]: 2584/7898 cut-off events. [2025-03-15 00:36:13,771 INFO L125 PetriNetUnfolderBase]: For 71325/77309 co-relation queries the response was YES. [2025-03-15 00:36:13,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71170 conditions, 7898 events. 2584/7898 cut-off events. For 71325/77309 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 49713 event pairs, 352 based on Foata normal form. 7/7369 useless extension candidates. Maximal degree in co-relation 62363. Up to 5122 conditions per place. [2025-03-15 00:36:13,825 INFO L140 encePairwiseOnDemand]: 438/457 looper letters, 992 selfloop transitions, 115 changer transitions 43/1490 dead transitions. [2025-03-15 00:36:13,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 1490 transitions, 32911 flow [2025-03-15 00:36:13,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:36:13,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:36:13,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1886 transitions. [2025-03-15 00:36:13,828 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.687819110138585 [2025-03-15 00:36:13,828 INFO L298 CegarLoopForPetriNet]: 457 programPoint places, 99 predicate places. [2025-03-15 00:36:13,828 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 1490 transitions, 32911 flow [2025-03-15 00:36:13,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 290.6666666666667) internal successors, (1744), 6 states have internal predecessors, (1744), 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) [2025-03-15 00:36:13,828 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:13,829 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:36:13,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 00:36:13,829 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-15 00:36:13,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:13,831 INFO L85 PathProgramCache]: Analyzing trace with hash 957293812, now seen corresponding path program 1 times [2025-03-15 00:36:13,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:13,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467392188] [2025-03-15 00:36:13,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:36:13,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:36:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 1058 proven. 3113 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2025-03-15 00:36:51,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:51,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467392188] [2025-03-15 00:36:51,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467392188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:36:51,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064492229] [2025-03-15 00:36:51,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:36:51,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:36:51,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:36:51,805 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:36:51,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-15 00:36:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:36:53,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 4988 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-03-15 00:36:53,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:36:53,403 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 00:36:53,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 00:36:53,558 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 00:36:53,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 00:36:53,825 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 00:36:53,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 00:36:53,978 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-15 00:36:53,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-15 00:36:54,731 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-15 00:36:54,731 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 22 treesize of output 33 [2025-03-15 00:36:55,286 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-15 00:36:55,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-03-15 00:36:56,232 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-15 00:36:56,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-03-15 00:36:56,735 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-15 00:36:56,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-03-15 00:36:58,186 INFO L349 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2025-03-15 00:36:58,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2025-03-15 00:36:59,298 INFO L349 Elim1Store]: treesize reduction 90, result has 33.8 percent of original size [2025-03-15 00:36:59,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 69 [2025-03-15 00:37:02,535 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2025-03-15 00:37:02,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 44 treesize of output 76 [2025-03-15 00:37:04,301 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2025-03-15 00:37:04,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 44 treesize of output 76 [2025-03-15 00:37:07,436 INFO L349 Elim1Store]: treesize reduction 108, result has 33.7 percent of original size [2025-03-15 00:37:07,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 42 treesize of output 81 [2025-03-15 00:37:10,559 INFO L349 Elim1Store]: treesize reduction 140, result has 31.4 percent of original size [2025-03-15 00:37:10,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 49 treesize of output 88 [2025-03-15 00:37:15,645 INFO L349 Elim1Store]: treesize reduction 140, result has 31.4 percent of original size [2025-03-15 00:37:15,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 49 treesize of output 88 [2025-03-15 00:37:19,675 INFO L349 Elim1Store]: treesize reduction 140, result has 31.4 percent of original size [2025-03-15 00:37:19,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 49 treesize of output 88 [2025-03-15 00:37:25,237 INFO L349 Elim1Store]: treesize reduction 140, result has 31.4 percent of original size [2025-03-15 00:37:25,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 49 treesize of output 88 [2025-03-15 00:37:29,035 INFO L349 Elim1Store]: treesize reduction 140, result has 31.4 percent of original size [2025-03-15 00:37:29,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 49 treesize of output 88 [2025-03-15 00:37:33,918 INFO L349 Elim1Store]: treesize reduction 140, result has 31.4 percent of original size [2025-03-15 00:37:33,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 49 treesize of output 88 [2025-03-15 00:37:36,794 INFO L349 Elim1Store]: treesize reduction 140, result has 31.4 percent of original size [2025-03-15 00:37:36,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 49 treesize of output 88 [2025-03-15 00:37:43,649 INFO L349 Elim1Store]: treesize reduction 140, result has 31.4 percent of original size [2025-03-15 00:37:43,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 49 treesize of output 88 [2025-03-15 00:37:51,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-15 00:37:51,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-03-15 00:37:52,805 INFO L349 Elim1Store]: treesize reduction 28, result has 50.9 percent of original size [2025-03-15 00:37:52,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 53 [2025-03-15 00:37:52,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:37:52,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2025-03-15 00:37:52,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:37:52,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2025-03-15 00:37:52,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2025-03-15 00:37:53,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 3765 proven. 248 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2025-03-15 00:37:53,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:37:53,048 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_11732) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_11732) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_11732) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse0)) 0)) (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_11732) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse0 1)) 0)))) is different from false [2025-03-15 00:37:53,066 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse2 (+ |c_~#slot~0.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse2 0)))) (and (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_11732) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_11732) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1)) 0)) (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_11732) |c_~#slot~0.base|) .cse2) 0)) (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_11732) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1)) 0)))))) is different from false [2025-03-15 00:37:53,238 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse3 (+ |c_~#slot~0.offset| 2 .cse1)) (.cse2 (+ |c_~#slot~0.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (store (select |c_#race| |c_~#slot~0.base|) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_11732) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1)) 0)) (forall ((v_ArrVal_11732 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_11732) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1)))) (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_11732) |c_~#slot~0.base|) .cse2) 0)) (forall ((v_ArrVal_11732 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_11732) |c_~#slot~0.base|) .cse3))))))) is different from false [2025-03-15 00:38:00,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:38:00,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2025-03-15 00:38:00,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:38:00,497 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 83 treesize of output 39 [2025-03-15 00:38:00,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2025-03-15 00:38:00,504 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-15 00:38:00,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-03-15 00:38:00,509 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-15 00:38:00,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-03-15 00:38:00,512 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-15 00:38:00,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2025-03-15 00:38:08,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 4013 proven. 0 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2025-03-15 00:38:08,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064492229] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-15 00:38:08,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-15 00:38:08,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [34, 21] total 65 [2025-03-15 00:38:08,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577171632] [2025-03-15 00:38:08,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:38:08,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-15 00:38:08,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:38:08,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-15 00:38:08,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=688, Invalid=3160, Unknown=70, NotChecked=372, Total=4290 [2025-03-15 00:38:08,793 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 457 [2025-03-15 00:38:08,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 1490 transitions, 32911 flow. Second operand has 17 states, 17 states have (on average 267.47058823529414) internal successors, (4547), 17 states have internal predecessors, (4547), 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) [2025-03-15 00:38:08,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:38:08,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 457 [2025-03-15 00:38:08,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:38:12,273 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse8 (+ |c_~#slot~0.offset| 2 .cse10)) (.cse7 (+ |c_~#slot~0.offset| 3 .cse10))) (let ((.cse1 (+ |c_~#slot~0.offset| .cse10)) (.cse9 (+ |c_~#slot~0.offset| .cse10 1)) (.cse0 (store |c_#race| |c_~#slot~0.base| (store (store (select |c_#race| |c_~#slot~0.base|) .cse8 0) .cse7 0)))) (and (forall ((|v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15| Int)) (or (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store .cse0 |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15| v_ArrVal_11732) |c_~#slot~0.base|) .cse1) 0)) (not (= (select |c_#valid| |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15|) 0)))) (forall ((|v_ULTIMATE.start_new_#t~malloc30#1.base_182| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_186| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_166| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_198| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_178| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_202| Int)) (let ((.cse4 (store |c_#valid| |v_ULTIMATE.start_new_#t~malloc30#1.base_202| 1))) (let ((.cse5 (store .cse4 |v_ULTIMATE.start_new_#t~malloc30#1.base_198| 1))) (let ((.cse6 (store .cse5 |v_ULTIMATE.start_new_#t~malloc30#1.base_186| 1))) (let ((.cse2 (store .cse6 |v_ULTIMATE.start_new_#t~malloc30#1.base_182| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_new_#t~malloc30#1.base_178| 1))) (or (not (= (select .cse2 |v_ULTIMATE.start_new_#t~malloc30#1.base_178|) 0)) (not (= (select (store .cse3 |v_ULTIMATE.start_new_#t~malloc30#1.base_166| 1) 2) 0)) (not (= (select .cse4 |v_ULTIMATE.start_new_#t~malloc30#1.base_198|) 0)) (not (= (select .cse3 |v_ULTIMATE.start_new_#t~malloc30#1.base_166|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_new_#t~malloc30#1.base_202|) 0)) (not (= (select .cse5 |v_ULTIMATE.start_new_#t~malloc30#1.base_186|) 0)) (not (= (select .cse6 |v_ULTIMATE.start_new_#t~malloc30#1.base_182|) 0))))))))) (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_11732) |c_~#slot~0.base|) .cse7) 0)) (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_11732) |c_~#slot~0.base|) .cse8) 0)) (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_11732) |c_~#slot~0.base|) .cse1) 0)) (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_11732) |c_~#slot~0.base|) .cse9) 0)) (not (= (select |c_#valid| |c_~#slot~0.base|) 0)) (forall ((|v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15| Int)) (or (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store .cse0 |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15| v_ArrVal_11732) |c_~#slot~0.base|) .cse7) 0)) (not (= (select |c_#valid| |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15|) 0)))) (forall ((|v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15| Int)) (or (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store .cse0 |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15| v_ArrVal_11732) |c_~#slot~0.base|) .cse9) 0)) (not (= (select |c_#valid| |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15|) 0)))) (forall ((|v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15| Int)) (or (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store .cse0 |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15| v_ArrVal_11732) |c_~#slot~0.base|) .cse8) 0)) (not (= (select |c_#valid| |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15|) 0)))))))) is different from false [2025-03-15 00:38:12,336 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse7 (select |c_#race| |c_~#slot~0.base|)) (.cse10 (+ |c_~#slot~0.offset| 2 .cse11)) (.cse9 (+ |c_~#slot~0.offset| 3 .cse11))) (let ((.cse1 (+ |c_~#slot~0.offset| .cse11)) (.cse8 (+ |c_~#slot~0.offset| .cse11 1)) (.cse0 (store |c_#race| |c_~#slot~0.base| (store (store .cse7 .cse10 0) .cse9 0)))) (and (forall ((|v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15| Int)) (or (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store .cse0 |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15| v_ArrVal_11732) |c_~#slot~0.base|) .cse1) 0)) (not (= (select |c_#valid| |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15|) 0)))) (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_11732) |c_~#slot~0.base|) .cse1) 0)) (forall ((|v_ULTIMATE.start_new_#t~malloc30#1.base_182| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_186| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_166| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_198| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_178| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_202| Int)) (let ((.cse4 (store |c_#valid| |v_ULTIMATE.start_new_#t~malloc30#1.base_202| 1))) (let ((.cse5 (store .cse4 |v_ULTIMATE.start_new_#t~malloc30#1.base_198| 1))) (let ((.cse6 (store .cse5 |v_ULTIMATE.start_new_#t~malloc30#1.base_186| 1))) (let ((.cse2 (store .cse6 |v_ULTIMATE.start_new_#t~malloc30#1.base_182| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_new_#t~malloc30#1.base_178| 1))) (or (not (= (select .cse2 |v_ULTIMATE.start_new_#t~malloc30#1.base_178|) 0)) (not (= (select (store .cse3 |v_ULTIMATE.start_new_#t~malloc30#1.base_166| 1) 2) 0)) (not (= (select .cse4 |v_ULTIMATE.start_new_#t~malloc30#1.base_198|) 0)) (not (= (select .cse3 |v_ULTIMATE.start_new_#t~malloc30#1.base_166|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_new_#t~malloc30#1.base_202|) 0)) (not (= (select .cse5 |v_ULTIMATE.start_new_#t~malloc30#1.base_186|) 0)) (not (= (select .cse6 |v_ULTIMATE.start_new_#t~malloc30#1.base_182|) 0))))))))) (= (select .cse7 .cse8) 0) (= (select .cse7 .cse9) 0) (forall ((v_ArrVal_11732 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_11732) |c_~#slot~0.base|) .cse8))) (= (select .cse7 .cse10) 0) (not (= (select |c_#valid| |c_~#slot~0.base|) 0)) (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_11732) |c_~#slot~0.base|) .cse9) 0)) (forall ((|v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15| Int)) (or (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store .cse0 |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15| v_ArrVal_11732) |c_~#slot~0.base|) .cse9) 0)) (not (= (select |c_#valid| |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15|) 0)))) (forall ((v_ArrVal_11732 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_11732) |c_~#slot~0.base|) .cse10))) (= 0 (select .cse7 .cse1)) (forall ((|v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15| Int)) (or (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store .cse0 |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15| v_ArrVal_11732) |c_~#slot~0.base|) .cse8) 0)) (not (= (select |c_#valid| |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15|) 0)))) (forall ((|v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15| Int)) (or (forall ((v_ArrVal_11732 (Array Int Int))) (= (select (select (store .cse0 |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15| v_ArrVal_11732) |c_~#slot~0.base|) .cse10) 0)) (not (= (select |c_#valid| |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_15|) 0)))))))) is different from false [2025-03-15 00:38:23,865 INFO L124 PetriNetUnfolderBase]: 4971/13984 cut-off events. [2025-03-15 00:38:23,865 INFO L125 PetriNetUnfolderBase]: For 154421/166956 co-relation queries the response was YES. [2025-03-15 00:38:23,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136703 conditions, 13984 events. 4971/13984 cut-off events. For 154421/166956 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 109136 event pairs, 549 based on Foata normal form. 116/13098 useless extension candidates. Maximal degree in co-relation 127334. Up to 9192 conditions per place. [2025-03-15 00:38:23,970 INFO L140 encePairwiseOnDemand]: 408/457 looper letters, 1733 selfloop transitions, 446 changer transitions 79/2548 dead transitions. [2025-03-15 00:38:23,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 2548 transitions, 64025 flow [2025-03-15 00:38:23,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-15 00:38:23,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-15 00:38:23,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 5542 transitions. [2025-03-15 00:38:23,974 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6063457330415755 [2025-03-15 00:38:23,974 INFO L298 CegarLoopForPetriNet]: 457 programPoint places, 118 predicate places. [2025-03-15 00:38:23,974 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 2548 transitions, 64025 flow [2025-03-15 00:38:23,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 267.47058823529414) internal successors, (4547), 17 states have internal predecessors, (4547), 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) [2025-03-15 00:38:23,975 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:38:23,975 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:38:23,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-15 00:38:24,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-15 00:38:24,176 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-15 00:38:24,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:38:24,178 INFO L85 PathProgramCache]: Analyzing trace with hash 932478024, now seen corresponding path program 2 times [2025-03-15 00:38:24,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:38:24,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216782044] [2025-03-15 00:38:24,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:38:24,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:38:27,084 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 00:38:27,084 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:39:05,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 788 proven. 373 refuted. 0 times theorem prover too weak. 3619 trivial. 0 not checked. [2025-03-15 00:39:05,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:39:05,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216782044] [2025-03-15 00:39:05,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216782044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:39:05,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734739491] [2025-03-15 00:39:05,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:39:05,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:39:05,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:39:05,608 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:39:05,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-15 00:39:17,577 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 00:39:17,577 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:39:17,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 4988 conjuncts, 217 conjuncts are in the unsatisfiable core [2025-03-15 00:39:17,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:39:17,700 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-15 00:39:17,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-15 00:39:17,929 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:39:17,929 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 [2025-03-15 00:39:18,557 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:39:18,557 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 [2025-03-15 00:39:18,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-15 00:39:18,982 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:39:18,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-15 00:39:19,119 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 29 treesize of output 22 [2025-03-15 00:39:19,230 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 29 treesize of output 22 [2025-03-15 00:39:19,463 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 30 treesize of output 12 [2025-03-15 00:39:19,926 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-15 00:39:19,926 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 22 treesize of output 33 [2025-03-15 00:39:20,922 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-15 00:39:20,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-03-15 00:39:22,395 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-15 00:39:22,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-15 00:39:23,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-15 00:39:23,869 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-15 00:39:23,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-15 00:39:24,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2025-03-15 00:39:24,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2025-03-15 00:39:25,044 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 50 treesize of output 20 [2025-03-15 00:39:26,408 INFO L349 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2025-03-15 00:39:26,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2025-03-15 00:39:27,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-15 00:39:27,826 INFO L349 Elim1Store]: treesize reduction 118, result has 33.0 percent of original size [2025-03-15 00:39:27,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 45 treesize of output 76 [2025-03-15 00:39:28,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 55 [2025-03-15 00:39:28,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 55 [2025-03-15 00:39:29,132 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 62 treesize of output 26 [2025-03-15 00:39:31,137 INFO L349 Elim1Store]: treesize reduction 70, result has 27.1 percent of original size [2025-03-15 00:39:31,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 46 [2025-03-15 00:39:32,323 INFO L349 Elim1Store]: treesize reduction 70, result has 27.1 percent of original size [2025-03-15 00:39:32,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 46 [2025-03-15 00:39:35,193 INFO L349 Elim1Store]: treesize reduction 70, result has 27.1 percent of original size [2025-03-15 00:39:35,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 46 [2025-03-15 00:39:36,483 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-15 00:39:36,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-15 00:39:38,717 INFO L349 Elim1Store]: treesize reduction 90, result has 33.8 percent of original size [2025-03-15 00:39:38,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 69 [2025-03-15 00:39:41,002 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2025-03-15 00:39:41,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 44 treesize of output 76 [2025-03-15 00:39:44,899 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2025-03-15 00:39:44,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 44 treesize of output 76 [2025-03-15 00:39:48,350 INFO L349 Elim1Store]: treesize reduction 84, result has 27.0 percent of original size [2025-03-15 00:39:48,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 54 [2025-03-15 00:39:52,296 INFO L349 Elim1Store]: treesize reduction 84, result has 27.0 percent of original size [2025-03-15 00:39:52,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 54 [2025-03-15 00:39:58,975 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2025-03-15 00:39:58,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 44 treesize of output 76 [2025-03-15 00:40:05,828 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2025-03-15 00:40:05,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 44 treesize of output 76 [2025-03-15 00:40:11,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-15 00:40:12,409 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2025-03-15 00:40:12,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 46 [2025-03-15 00:40:12,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-03-15 00:40:12,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:40:12,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2025-03-15 00:40:12,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:40:12,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2025-03-15 00:40:12,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2025-03-15 00:40:12,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 2452 proven. 1832 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-15 00:40:12,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:40:12,968 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (forall ((v_ArrVal_14453 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_14453) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_14453 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_14453) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse0)) 0)) (forall ((v_ArrVal_14453 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_14453) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse0 1)) 0)) (forall ((v_ArrVal_14453 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_14453) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse0)) 0)))) is different from false [2025-03-15 00:40:13,198 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse4 (+ |c_~#slot~0.offset| .cse3 1)) (.cse2 (+ |c_~#slot~0.offset| 2 .cse3)) (.cse1 (+ |c_~#slot~0.offset| 3 .cse3))) (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (store (store (select |c_#race| |c_~#slot~0.base|) .cse4 0) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_14453 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_14453) |c_~#slot~0.base|) .cse1) 0)) (forall ((v_ArrVal_14453 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_14453) |c_~#slot~0.base|) .cse2) 0)) (forall ((v_ArrVal_14453 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_14453) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse3)) 0)) (forall ((v_ArrVal_14453 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_14453) |c_~#slot~0.base|) .cse4) 0)))))) is different from false [2025-03-15 00:40:13,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:40:13,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2025-03-15 00:40:13,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:40:13,580 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 81 treesize of output 38 [2025-03-15 00:40:13,582 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 9 treesize of output 3 [2025-03-15 00:40:13,591 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-15 00:40:13,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-03-15 00:40:13,595 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-15 00:40:13,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-03-15 00:40:13,600 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-15 00:40:13,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-03-15 00:40:27,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 3980 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-15 00:40:27,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734739491] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-15 00:40:27,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-15 00:40:27,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [23, 68] total 102 [2025-03-15 00:40:27,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363334292] [2025-03-15 00:40:27,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:40:27,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-15 00:40:27,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:40:27,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-15 00:40:27,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1400, Invalid=8680, Unknown=28, NotChecked=398, Total=10506 [2025-03-15 00:40:27,049 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 457 [2025-03-15 00:40:27,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 2548 transitions, 64025 flow. Second operand has 16 states, 16 states have (on average 264.875) internal successors, (4238), 16 states have internal predecessors, (4238), 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) [2025-03-15 00:40:27,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:40:27,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 457 [2025-03-15 00:40:27,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:40:31,340 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse10 (select |c_#race| |c_~#slot~0.base|)) (.cse4 (+ |c_~#slot~0.offset| .cse11 1)) (.cse3 (+ |c_~#slot~0.offset| 2 .cse11)) (.cse1 (+ |c_~#slot~0.offset| 3 .cse11))) (let ((.cse5 (+ |c_~#slot~0.offset| .cse11)) (.cse0 (store |c_#race| |c_~#slot~0.base| (store (store (store .cse10 .cse4 0) .cse3 0) .cse1 0))) (.cse2 (store |c_#race| |c_~#slot~0.base| (store (store .cse10 .cse3 0) .cse1 0)))) (and (forall ((|v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19| Int)) (or (not (= (select |c_#valid| |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19|) 0)) (forall ((v_ArrVal_14453 (Array Int Int))) (= (select (select (store .cse0 |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19| v_ArrVal_14453) |c_~#slot~0.base|) .cse1) 0)))) (forall ((v_ArrVal_14453 (Array Int Int))) (= (select (select (store .cse2 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_14453) |c_~#slot~0.base|) .cse3) 0)) (forall ((v_ArrVal_14453 (Array Int Int))) (= (select (select (store .cse2 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_14453) |c_~#slot~0.base|) .cse4) 0)) (forall ((|v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19| Int)) (or (forall ((v_ArrVal_14453 (Array Int Int))) (= (select (select (store .cse0 |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19| v_ArrVal_14453) |c_~#slot~0.base|) .cse5) 0)) (not (= (select |c_#valid| |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19|) 0)))) (forall ((|v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19| Int)) (or (not (= (select |c_#valid| |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19|) 0)) (forall ((v_ArrVal_14453 (Array Int Int))) (= (select (select (store .cse0 |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19| v_ArrVal_14453) |c_~#slot~0.base|) .cse4) 0)))) (not (= (select |c_#valid| |c_~#slot~0.base|) 0)) (forall ((v_ArrVal_14453 (Array Int Int))) (= (select (select (store .cse2 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_14453) |c_~#slot~0.base|) .cse5) 0)) (forall ((|v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19| Int)) (or (not (= (select |c_#valid| |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19|) 0)) (forall ((v_ArrVal_14453 (Array Int Int))) (= (select (select (store .cse0 |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19| v_ArrVal_14453) |c_~#slot~0.base|) .cse3) 0)))) (forall ((v_ArrVal_14453 (Array Int Int))) (= (select (select (store .cse2 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_14453) |c_~#slot~0.base|) .cse1) 0)) (forall ((|v_ULTIMATE.start_new_#t~malloc30#1.base_307| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_291| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_251| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_287| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_275| Int)) (let ((.cse8 (store |c_#valid| |v_ULTIMATE.start_new_#t~malloc30#1.base_307| 1))) (let ((.cse7 (store .cse8 |v_ULTIMATE.start_new_#t~malloc30#1.base_291| 1))) (let ((.cse9 (store .cse7 |v_ULTIMATE.start_new_#t~malloc30#1.base_287| 1))) (let ((.cse6 (store .cse9 |v_ULTIMATE.start_new_#t~malloc30#1.base_275| 1))) (or (not (= (select .cse6 |v_ULTIMATE.start_new_#t~malloc30#1.base_251|) 0)) (not (= (select .cse7 |v_ULTIMATE.start_new_#t~malloc30#1.base_287|) 0)) (not (= (select .cse8 |v_ULTIMATE.start_new_#t~malloc30#1.base_291|) 0)) (not (= (select (store .cse6 |v_ULTIMATE.start_new_#t~malloc30#1.base_251| 1) 2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_new_#t~malloc30#1.base_307|) 0)) (not (= (select .cse9 |v_ULTIMATE.start_new_#t~malloc30#1.base_275|) 0)))))))))))) is different from false [2025-03-15 00:40:51,714 INFO L124 PetriNetUnfolderBase]: 7297/20019 cut-off events. [2025-03-15 00:40:51,714 INFO L125 PetriNetUnfolderBase]: For 257251/276365 co-relation queries the response was YES. [2025-03-15 00:40:51,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210063 conditions, 20019 events. 7297/20019 cut-off events. For 257251/276365 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 173907 event pairs, 885 based on Foata normal form. 251/18781 useless extension candidates. Maximal degree in co-relation 200132. Up to 13210 conditions per place. [2025-03-15 00:40:51,881 INFO L140 encePairwiseOnDemand]: 416/457 looper letters, 2446 selfloop transitions, 637 changer transitions 113/3486 dead transitions. [2025-03-15 00:40:51,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 3486 transitions, 96049 flow [2025-03-15 00:40:51,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-15 00:40:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-15 00:40:51,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 5229 transitions. [2025-03-15 00:40:51,884 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6022112173212023 [2025-03-15 00:40:51,884 INFO L298 CegarLoopForPetriNet]: 457 programPoint places, 136 predicate places. [2025-03-15 00:40:51,884 INFO L471 AbstractCegarLoop]: Abstraction has has 593 places, 3486 transitions, 96049 flow [2025-03-15 00:40:51,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 264.875) internal successors, (4238), 16 states have internal predecessors, (4238), 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) [2025-03-15 00:40:51,886 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:40:51,886 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:40:51,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-15 00:40:52,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-15 00:40:52,087 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-15 00:40:52,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:40:52,089 INFO L85 PathProgramCache]: Analyzing trace with hash -759175760, now seen corresponding path program 3 times [2025-03-15 00:40:52,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:40:52,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489403718] [2025-03-15 00:40:52,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:40:52,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:40:58,153 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-15 00:40:58,154 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:41:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 538 proven. 2340 refuted. 0 times theorem prover too weak. 1902 trivial. 0 not checked. [2025-03-15 00:41:53,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:41:53,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489403718] [2025-03-15 00:41:53,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489403718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:41:53,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558211763] [2025-03-15 00:41:53,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:41:53,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:41:53,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:41:53,684 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:41:53,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process Received shutdown request... [2025-03-15 00:49:28,649 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 00:49:28,659 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 00:49:29,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2025-03-15 00:49:29,865 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forcibly destroying the process [2025-03-15 00:49:29,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 137 [2025-03-15 00:49:29,901 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-15 00:49:29,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-15 00:49:29,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2025-03-15 00:49:29,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739516739] [2025-03-15 00:49:29,901 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-15 00:49:29,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-15 00:49:29,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:49:29,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-15 00:49:29,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1549, Unknown=0, NotChecked=0, Total=1806 [2025-03-15 00:49:29,905 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 457 [2025-03-15 00:49:29,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 3486 transitions, 96049 flow. Second operand has 43 states, 43 states have (on average 182.65116279069767) internal successors, (7854), 43 states have internal predecessors, (7854), 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) [2025-03-15 00:49:29,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:49:29,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 457 [2025-03-15 00:49:29,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:49:29,912 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (34 of 35 remaining) [2025-03-15 00:49:29,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 00:49:29,913 WARN L596 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-03-15 00:49:29,914 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (33 of 35 remaining) [2025-03-15 00:49:29,914 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (32 of 35 remaining) [2025-03-15 00:49:29,914 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (31 of 35 remaining) [2025-03-15 00:49:29,914 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (30 of 35 remaining) [2025-03-15 00:49:29,914 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (29 of 35 remaining) [2025-03-15 00:49:29,914 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (27 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (26 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (25 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (23 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (22 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (21 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (20 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (19 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (18 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (17 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (16 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (15 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (14 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (13 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (7 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 35 remaining) [2025-03-15 00:49:29,915 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 35 remaining) [2025-03-15 00:49:29,916 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 35 remaining) [2025-03-15 00:49:29,916 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 35 remaining) [2025-03-15 00:49:29,916 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 35 remaining) [2025-03-15 00:49:29,916 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 35 remaining) [2025-03-15 00:49:29,916 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:49:29,919 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:49:29,919 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:49:29,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:49:29 BasicIcfg [2025-03-15 00:49:29,922 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:49:29,923 INFO L158 Benchmark]: Toolchain (without parser) took 842180.72ms. Allocated memory was 71.3MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 40.4MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 241.9MB. Max. memory is 8.0GB. [2025-03-15 00:49:29,923 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory is still 37.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:49:29,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.23ms. Allocated memory is still 71.3MB. Free memory was 40.2MB in the beginning and 22.0MB in the end (delta: 18.3MB). Peak memory consumption was 31.7MB. Max. memory is 8.0GB. [2025-03-15 00:49:29,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.91ms. Allocated memory is still 71.3MB. Free memory was 22.0MB in the beginning and 37.4MB in the end (delta: -15.4MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. [2025-03-15 00:49:29,923 INFO L158 Benchmark]: Boogie Preprocessor took 61.97ms. Allocated memory is still 71.3MB. Free memory was 37.4MB in the beginning and 33.0MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:49:29,923 INFO L158 Benchmark]: RCFGBuilder took 818.33ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 32.7MB in the beginning and 28.1MB in the end (delta: 4.6MB). Peak memory consumption was 28.8MB. Max. memory is 8.0GB. [2025-03-15 00:49:29,923 INFO L158 Benchmark]: TraceAbstraction took 840745.25ms. Allocated memory was 96.5MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 27.3MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 206.4MB. Max. memory is 8.0GB. [2025-03-15 00:49:29,924 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory is still 37.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 463.23ms. Allocated memory is still 71.3MB. Free memory was 40.2MB in the beginning and 22.0MB in the end (delta: 18.3MB). Peak memory consumption was 31.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 86.91ms. Allocated memory is still 71.3MB. Free memory was 22.0MB in the beginning and 37.4MB in the end (delta: -15.4MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.97ms. Allocated memory is still 71.3MB. Free memory was 37.4MB in the beginning and 33.0MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 818.33ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 32.7MB in the beginning and 28.1MB in the end (delta: 4.6MB). Peak memory consumption was 28.8MB. Max. memory is 8.0GB. * TraceAbstraction took 840745.25ms. Allocated memory was 96.5MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 27.3MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 206.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1269]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1256]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1265]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1257]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1266]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1269]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1270]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1267]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1249]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 545 locations, 35 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 840.6s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 68.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 225 mSolverCounterUnknown, 1378 SdHoareTripleChecker+Valid, 13.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1378 mSDsluCounter, 3349 SdHoareTripleChecker+Invalid, 12.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3294 IncrementalHoareTripleChecker+Unchecked, 956 mSDsCounter, 429 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9647 IncrementalHoareTripleChecker+Invalid, 13596 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 429 mSolverCounterUnsat, 2393 mSDtfsCounter, 9647 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8988 GetRequests, 8561 SyntacticMatches, 68 SemanticMatches, 359 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 14255 ImplicationChecksByTransitivity, 50.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96049occurred in iteration=18, InterpolantAutomatonStates: 174, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 25.1s SatisfiabilityAnalysisTime, 286.6s InterpolantComputationTime, 16044 NumberOfCodeBlocks, 13924 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 20276 ConstructedInterpolants, 3716 QuantifiedInterpolants, 351417 SizeOfPredicates, 136 NumberOfNonLiveVariables, 16171 ConjunctsInSsa, 356 ConjunctsInUnsatCore, 29 InterpolantComputations, 15 PerfectInterpolantSequences, 42448/58019 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown