/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_13-arraycollapse_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:36:22,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:36:22,630 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:36:22,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:36:22,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:36:22,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:36:22,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:36:22,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:36:22,688 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:36:22,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:36:22,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:36:22,689 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:36:22,689 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:36:22,689 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:36:22,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:36:22,690 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:36:22,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:36:22,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:36:22,690 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:36:22,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:36:22,690 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:36:22,690 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:36:22,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:36:22,691 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:36:22,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:36:22,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:36:22,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:36:22,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:36:22,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:36:22,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:36:22,691 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:36:22,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:36:22,692 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:36:22,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:36:22,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:36:22,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:36:22,923 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:36:22,923 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:36:22,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr.i [2025-03-15 00:36:24,095 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bdeda564/faa1b5351937423197b0fce7445c3ba3/FLAGfdbb3aa64 [2025-03-15 00:36:24,321 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:36:24,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr.i [2025-03-15 00:36:24,338 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bdeda564/faa1b5351937423197b0fce7445c3ba3/FLAGfdbb3aa64 [2025-03-15 00:36:24,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bdeda564/faa1b5351937423197b0fce7445c3ba3 [2025-03-15 00:36:24,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:36:24,355 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:36:24,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:36:24,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:36:24,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:36:24,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:36:24" (1/1) ... [2025-03-15 00:36:24,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b52e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:36:24, skipping insertion in model container [2025-03-15 00:36:24,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:36:24" (1/1) ... [2025-03-15 00:36:24,384 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:36:24,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:36:24,695 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:36:24,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:36:24,822 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:36:24,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:36:24 WrapperNode [2025-03-15 00:36:24,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:36:24,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:36:24,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:36:24,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:36:24,828 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:36:24" (1/1) ... [2025-03-15 00:36:24,852 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:36:24" (1/1) ... [2025-03-15 00:36:24,900 INFO L138 Inliner]: procedures = 372, calls = 95, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 414 [2025-03-15 00:36:24,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:36:24,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:36:24,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:36:24,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:36:24,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:36:24" (1/1) ... [2025-03-15 00:36:24,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:36:24" (1/1) ... [2025-03-15 00:36:24,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:36:24" (1/1) ... [2025-03-15 00:36:24,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:36:24" (1/1) ... [2025-03-15 00:36:24,934 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:36:24" (1/1) ... [2025-03-15 00:36:24,936 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:36:24" (1/1) ... [2025-03-15 00:36:24,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:36:24" (1/1) ... [2025-03-15 00:36:24,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:36:24" (1/1) ... [2025-03-15 00:36:24,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:36:24" (1/1) ... [2025-03-15 00:36:24,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:36:24,948 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:36:24,948 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:36:24,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:36:24,949 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:36:24" (1/1) ... [2025-03-15 00:36:24,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:36:24,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:36:24,980 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:36:24,984 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:36:25,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-15 00:36:25,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-15 00:36:25,001 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:36:25,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:36:25,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:36:25,001 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:36:25,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 00:36:25,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:36:25,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-15 00:36:25,001 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 00:36:25,002 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 00:36:25,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:36:25,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:36:25,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:36:25,003 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:36:25,120 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:36:25,122 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:36:25,809 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:36:25,809 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:36:25,848 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:36:25,848 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:36:25,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:36:25 BoogieIcfgContainer [2025-03-15 00:36:25,849 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:36:25,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:36:25,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:36:25,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:36:25,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:36:24" (1/3) ... [2025-03-15 00:36:25,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494f12ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:36:25, skipping insertion in model container [2025-03-15 00:36:25,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:36:24" (2/3) ... [2025-03-15 00:36:25,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494f12ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:36:25, skipping insertion in model container [2025-03-15 00:36:25,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:36:25" (3/3) ... [2025-03-15 00:36:25,857 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr.i [2025-03-15 00:36:25,868 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:36:25,870 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_13-arraycollapse_nr.i that has 2 procedures, 485 locations, 1 initial locations, 1 loop locations, and 30 error locations. [2025-03-15 00:36:25,870 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:36:25,950 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 00:36:25,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:36:26,005 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;@2645ab07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:36:26,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-03-15 00:36:26,074 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:36:26,075 INFO L124 PetriNetUnfolderBase]: 1/101 cut-off events. [2025-03-15 00:36:26,076 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:36:26,076 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:26,077 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:36:26,077 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-15 00:36:26,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:26,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1684636376, now seen corresponding path program 1 times [2025-03-15 00:36:26,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:26,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631922497] [2025-03-15 00:36:26,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:36:26,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:36:27,010 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:36:27,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:27,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631922497] [2025-03-15 00:36:27,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631922497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:36:27,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:36:27,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:36:27,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990473975] [2025-03-15 00:36:27,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:36:27,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:36:27,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:27,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:36:27,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:36:27,045 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 488 [2025-03-15 00:36:27,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 488 transitions, 980 flow. Second operand has 6 states, 6 states have (on average 269.5) internal successors, (1617), 6 states have internal predecessors, (1617), 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:27,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:27,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 488 [2025-03-15 00:36:27,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:27,977 INFO L124 PetriNetUnfolderBase]: 761/2631 cut-off events. [2025-03-15 00:36:27,978 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 00:36:27,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4369 conditions, 2631 events. 761/2631 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 14254 event pairs, 760 based on Foata normal form. 19/2364 useless extension candidates. Maximal degree in co-relation 3855. Up to 1714 conditions per place. [2025-03-15 00:36:28,004 INFO L140 encePairwiseOnDemand]: 461/488 looper letters, 193 selfloop transitions, 20 changer transitions 2/480 dead transitions. [2025-03-15 00:36:28,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 480 transitions, 1389 flow [2025-03-15 00:36:28,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:36:28,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:36:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1828 transitions. [2025-03-15 00:36:28,027 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6243169398907104 [2025-03-15 00:36:28,029 INFO L298 CegarLoopForPetriNet]: 488 programPoint places, 0 predicate places. [2025-03-15 00:36:28,029 INFO L471 AbstractCegarLoop]: Abstraction has has 488 places, 480 transitions, 1389 flow [2025-03-15 00:36:28,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 269.5) internal successors, (1617), 6 states have internal predecessors, (1617), 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:28,030 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:28,030 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:36:28,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:36:28,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-15 00:36:28,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:28,031 INFO L85 PathProgramCache]: Analyzing trace with hash 105681652, now seen corresponding path program 1 times [2025-03-15 00:36:28,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:28,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013402336] [2025-03-15 00:36:28,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:36:28,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:36:28,521 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:36:28,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:28,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013402336] [2025-03-15 00:36:28,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013402336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:36:28,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:36:28,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:36:28,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871687748] [2025-03-15 00:36:28,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:36:28,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:36:28,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:28,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:36:28,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:36:28,527 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 488 [2025-03-15 00:36:28,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 480 transitions, 1389 flow. Second operand has 6 states, 6 states have (on average 270.5) internal successors, (1623), 6 states have internal predecessors, (1623), 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:28,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:28,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 488 [2025-03-15 00:36:28,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:29,371 INFO L124 PetriNetUnfolderBase]: 761/2627 cut-off events. [2025-03-15 00:36:29,371 INFO L125 PetriNetUnfolderBase]: For 198/348 co-relation queries the response was YES. [2025-03-15 00:36:29,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6091 conditions, 2627 events. 761/2627 cut-off events. For 198/348 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 14226 event pairs, 760 based on Foata normal form. 0/2345 useless extension candidates. Maximal degree in co-relation 5433. Up to 1710 conditions per place. [2025-03-15 00:36:29,380 INFO L140 encePairwiseOnDemand]: 464/488 looper letters, 189 selfloop transitions, 20 changer transitions 2/476 dead transitions. [2025-03-15 00:36:29,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 476 transitions, 1791 flow [2025-03-15 00:36:29,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:36:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:36:29,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1821 transitions. [2025-03-15 00:36:29,387 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6219262295081968 [2025-03-15 00:36:29,388 INFO L298 CegarLoopForPetriNet]: 488 programPoint places, 1 predicate places. [2025-03-15 00:36:29,389 INFO L471 AbstractCegarLoop]: Abstraction has has 489 places, 476 transitions, 1791 flow [2025-03-15 00:36:29,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 270.5) internal successors, (1623), 6 states have internal predecessors, (1623), 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:29,390 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:29,390 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:36:29,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:36:29,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-15 00:36:29,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:29,392 INFO L85 PathProgramCache]: Analyzing trace with hash -710489551, now seen corresponding path program 1 times [2025-03-15 00:36:29,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:29,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320545581] [2025-03-15 00:36:29,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:36:29,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:36:29,856 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:36:29,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:29,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320545581] [2025-03-15 00:36:29,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320545581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:36:29,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:36:29,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:36:29,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807254295] [2025-03-15 00:36:29,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:36:29,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:36:29,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:29,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:36:29,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:36:29,860 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 488 [2025-03-15 00:36:29,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 476 transitions, 1791 flow. Second operand has 6 states, 6 states have (on average 277.3333333333333) internal successors, (1664), 6 states have internal predecessors, (1664), 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:29,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:29,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 488 [2025-03-15 00:36:29,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:30,574 INFO L124 PetriNetUnfolderBase]: 859/2851 cut-off events. [2025-03-15 00:36:30,574 INFO L125 PetriNetUnfolderBase]: For 618/942 co-relation queries the response was YES. [2025-03-15 00:36:30,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8426 conditions, 2851 events. 859/2851 cut-off events. For 618/942 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15939 event pairs, 858 based on Foata normal form. 0/2552 useless extension candidates. Maximal degree in co-relation 7627. Up to 1916 conditions per place. [2025-03-15 00:36:30,587 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 199 selfloop transitions, 5 changer transitions 2/475 dead transitions. [2025-03-15 00:36:30,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 475 transitions, 2193 flow [2025-03-15 00:36:30,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:36:30,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:36:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1837 transitions. [2025-03-15 00:36:30,591 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6273907103825137 [2025-03-15 00:36:30,592 INFO L298 CegarLoopForPetriNet]: 488 programPoint places, 5 predicate places. [2025-03-15 00:36:30,592 INFO L471 AbstractCegarLoop]: Abstraction has has 493 places, 475 transitions, 2193 flow [2025-03-15 00:36:30,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 277.3333333333333) internal successors, (1664), 6 states have internal predecessors, (1664), 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:30,593 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:30,593 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:36:30,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:36:30,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-15 00:36:30,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:30,594 INFO L85 PathProgramCache]: Analyzing trace with hash -948055330, now seen corresponding path program 1 times [2025-03-15 00:36:30,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:30,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285781737] [2025-03-15 00:36:30,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:36:30,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:36:30,751 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:36:30,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:30,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285781737] [2025-03-15 00:36:30,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285781737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:36:30,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:36:30,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:36:30,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356472802] [2025-03-15 00:36:30,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:36:30,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:36:30,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:30,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:36:30,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:36:30,754 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 488 [2025-03-15 00:36:30,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 475 transitions, 2193 flow. Second operand has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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:30,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:30,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 488 [2025-03-15 00:36:30,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:31,478 INFO L124 PetriNetUnfolderBase]: 859/2960 cut-off events. [2025-03-15 00:36:31,478 INFO L125 PetriNetUnfolderBase]: For 1011/1344 co-relation queries the response was YES. [2025-03-15 00:36:31,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8928 conditions, 2960 events. 859/2960 cut-off events. For 1011/1344 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15949 event pairs, 858 based on Foata normal form. 0/2657 useless extension candidates. Maximal degree in co-relation 7793. Up to 1968 conditions per place. [2025-03-15 00:36:31,493 INFO L140 encePairwiseOnDemand]: 485/488 looper letters, 42 selfloop transitions, 2 changer transitions 2/492 dead transitions. [2025-03-15 00:36:31,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 492 transitions, 2393 flow [2025-03-15 00:36:31,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:36:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:36:31,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1416 transitions. [2025-03-15 00:36:31,496 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9672131147540983 [2025-03-15 00:36:31,497 INFO L298 CegarLoopForPetriNet]: 488 programPoint places, 7 predicate places. [2025-03-15 00:36:31,497 INFO L471 AbstractCegarLoop]: Abstraction has has 495 places, 492 transitions, 2393 flow [2025-03-15 00:36:31,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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:31,498 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:31,498 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:36:31,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:36:31,498 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-15 00:36:31,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:31,499 INFO L85 PathProgramCache]: Analyzing trace with hash 177590593, now seen corresponding path program 1 times [2025-03-15 00:36:31,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:31,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291605215] [2025-03-15 00:36:31,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:36:31,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:36:32,035 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:36:32,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:32,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291605215] [2025-03-15 00:36:32,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291605215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:36:32,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:36:32,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:36:32,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871645258] [2025-03-15 00:36:32,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:36:32,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:36:32,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:32,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:36:32,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:36:32,043 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 488 [2025-03-15 00:36:32,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 492 transitions, 2393 flow. Second operand has 6 states, 6 states have (on average 281.8333333333333) internal successors, (1691), 6 states have internal predecessors, (1691), 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:32,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:32,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 488 [2025-03-15 00:36:32,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:33,006 INFO L124 PetriNetUnfolderBase]: 859/2958 cut-off events. [2025-03-15 00:36:33,006 INFO L125 PetriNetUnfolderBase]: For 1535/2054 co-relation queries the response was YES. [2025-03-15 00:36:33,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10890 conditions, 2958 events. 859/2958 cut-off events. For 1535/2054 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15938 event pairs, 858 based on Foata normal form. 0/2657 useless extension candidates. Maximal degree in co-relation 9570. Up to 1966 conditions per place. [2025-03-15 00:36:33,022 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 208 selfloop transitions, 9 changer transitions 2/490 dead transitions. [2025-03-15 00:36:33,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 490 transitions, 2807 flow [2025-03-15 00:36:33,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:36:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:36:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1846 transitions. [2025-03-15 00:36:33,026 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.630464480874317 [2025-03-15 00:36:33,029 INFO L298 CegarLoopForPetriNet]: 488 programPoint places, 11 predicate places. [2025-03-15 00:36:33,029 INFO L471 AbstractCegarLoop]: Abstraction has has 499 places, 490 transitions, 2807 flow [2025-03-15 00:36:33,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 281.8333333333333) internal successors, (1691), 6 states have internal predecessors, (1691), 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:33,030 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:33,030 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:36:33,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:36:33,030 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-15 00:36:33,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:33,031 INFO L85 PathProgramCache]: Analyzing trace with hash 351751304, now seen corresponding path program 1 times [2025-03-15 00:36:33,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:33,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751077630] [2025-03-15 00:36:33,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:36:33,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:36:33,656 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:36:33,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:33,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751077630] [2025-03-15 00:36:33,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751077630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:36:33,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:36:33,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:36:33,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917918846] [2025-03-15 00:36:33,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:36:33,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:36:33,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:33,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:36:33,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:36:33,659 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 488 [2025-03-15 00:36:33,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 490 transitions, 2807 flow. Second operand has 6 states, 6 states have (on average 291.3333333333333) internal successors, (1748), 6 states have internal predecessors, (1748), 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:33,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:33,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 488 [2025-03-15 00:36:33,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:34,591 INFO L124 PetriNetUnfolderBase]: 859/2954 cut-off events. [2025-03-15 00:36:34,592 INFO L125 PetriNetUnfolderBase]: For 2408/3089 co-relation queries the response was YES. [2025-03-15 00:36:34,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12726 conditions, 2954 events. 859/2954 cut-off events. For 2408/3089 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15890 event pairs, 858 based on Foata normal form. 0/2657 useless extension candidates. Maximal degree in co-relation 11244. Up to 1962 conditions per place. [2025-03-15 00:36:34,613 INFO L140 encePairwiseOnDemand]: 470/488 looper letters, 182 selfloop transitions, 15 changer transitions 2/487 dead transitions. [2025-03-15 00:36:34,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 501 places, 487 transitions, 3171 flow [2025-03-15 00:36:34,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:36:34,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:36:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1900 transitions. [2025-03-15 00:36:34,617 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6489071038251366 [2025-03-15 00:36:34,619 INFO L298 CegarLoopForPetriNet]: 488 programPoint places, 13 predicate places. [2025-03-15 00:36:34,619 INFO L471 AbstractCegarLoop]: Abstraction has has 501 places, 487 transitions, 3171 flow [2025-03-15 00:36:34,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 291.3333333333333) internal successors, (1748), 6 states have internal predecessors, (1748), 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:34,620 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:34,620 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:36:34,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:36:34,621 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-15 00:36:34,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:34,621 INFO L85 PathProgramCache]: Analyzing trace with hash -25729275, now seen corresponding path program 1 times [2025-03-15 00:36:34,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:34,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317248693] [2025-03-15 00:36:34,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:36:34,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:36:34,989 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:36:34,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:34,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317248693] [2025-03-15 00:36:34,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317248693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:36:34,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:36:34,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:36:34,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913741297] [2025-03-15 00:36:34,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:36:34,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:36:34,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:34,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:36:34,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:36:34,991 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 488 [2025-03-15 00:36:34,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 487 transitions, 3171 flow. Second operand has 6 states, 6 states have (on average 286.5) internal successors, (1719), 6 states have internal predecessors, (1719), 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:34,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:34,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 488 [2025-03-15 00:36:34,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:35,715 INFO L124 PetriNetUnfolderBase]: 859/2950 cut-off events. [2025-03-15 00:36:35,716 INFO L125 PetriNetUnfolderBase]: For 3505/4334 co-relation queries the response was YES. [2025-03-15 00:36:35,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14562 conditions, 2950 events. 859/2950 cut-off events. For 3505/4334 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15860 event pairs, 858 based on Foata normal form. 0/2657 useless extension candidates. Maximal degree in co-relation 12918. Up to 1958 conditions per place. [2025-03-15 00:36:35,728 INFO L140 encePairwiseOnDemand]: 470/488 looper letters, 185 selfloop transitions, 15 changer transitions 2/484 dead transitions. [2025-03-15 00:36:35,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 484 transitions, 3535 flow [2025-03-15 00:36:35,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:36:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:36:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1867 transitions. [2025-03-15 00:36:35,732 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.637636612021858 [2025-03-15 00:36:35,732 INFO L298 CegarLoopForPetriNet]: 488 programPoint places, 15 predicate places. [2025-03-15 00:36:35,733 INFO L471 AbstractCegarLoop]: Abstraction has has 503 places, 484 transitions, 3535 flow [2025-03-15 00:36:35,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 286.5) internal successors, (1719), 6 states have internal predecessors, (1719), 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:35,733 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:35,733 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:36:35,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:36:35,734 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-15 00:36:35,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:35,734 INFO L85 PathProgramCache]: Analyzing trace with hash -2014753825, now seen corresponding path program 1 times [2025-03-15 00:36:35,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:35,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610986760] [2025-03-15 00:36:35,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:36:35,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:36:36,123 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:36:36,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:36,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610986760] [2025-03-15 00:36:36,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610986760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:36:36,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:36:36,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:36:36,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395405081] [2025-03-15 00:36:36,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:36:36,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:36:36,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:36,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:36:36,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:36:36,125 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 488 [2025-03-15 00:36:36,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 484 transitions, 3535 flow. Second operand has 6 states, 6 states have (on average 287.3333333333333) internal successors, (1724), 6 states have internal predecessors, (1724), 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:36,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:36,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 488 [2025-03-15 00:36:36,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:37,091 INFO L124 PetriNetUnfolderBase]: 859/2946 cut-off events. [2025-03-15 00:36:37,091 INFO L125 PetriNetUnfolderBase]: For 4838/5815 co-relation queries the response was YES. [2025-03-15 00:36:37,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16390 conditions, 2946 events. 859/2946 cut-off events. For 4838/5815 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15857 event pairs, 858 based on Foata normal form. 0/2657 useless extension candidates. Maximal degree in co-relation 14592. Up to 1954 conditions per place. [2025-03-15 00:36:37,106 INFO L140 encePairwiseOnDemand]: 470/488 looper letters, 182 selfloop transitions, 15 changer transitions 2/481 dead transitions. [2025-03-15 00:36:37,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 481 transitions, 3887 flow [2025-03-15 00:36:37,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:36:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:36:37,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1864 transitions. [2025-03-15 00:36:37,109 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6366120218579235 [2025-03-15 00:36:37,110 INFO L298 CegarLoopForPetriNet]: 488 programPoint places, 17 predicate places. [2025-03-15 00:36:37,110 INFO L471 AbstractCegarLoop]: Abstraction has has 505 places, 481 transitions, 3887 flow [2025-03-15 00:36:37,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 287.3333333333333) internal successors, (1724), 6 states have internal predecessors, (1724), 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:37,111 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:37,111 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:36:37,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:36:37,111 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-15 00:36:37,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:37,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1200167647, now seen corresponding path program 1 times [2025-03-15 00:36:37,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:37,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326651041] [2025-03-15 00:36:37,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:36:37,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:36:37,268 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:36:37,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:37,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326651041] [2025-03-15 00:36:37,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326651041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:36:37,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914995577] [2025-03-15 00:36:37,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:36:37,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:36:37,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:36:37,270 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:36:37,274 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:36:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:36:37,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 00:36:37,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:36:37,641 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:36:37,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:36:37,781 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:36:37,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914995577] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:36:37,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:36:37,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-15 00:36:37,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584281847] [2025-03-15 00:36:37,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:36:37,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:36:37,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:37,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:36:37,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-15 00:36:37,785 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 456 out of 488 [2025-03-15 00:36:37,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 481 transitions, 3887 flow. Second operand has 10 states, 10 states have (on average 461.7) internal successors, (4617), 10 states have internal predecessors, (4617), 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:37,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:37,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 456 of 488 [2025-03-15 00:36:37,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:38,565 INFO L124 PetriNetUnfolderBase]: 859/3054 cut-off events. [2025-03-15 00:36:38,565 INFO L125 PetriNetUnfolderBase]: For 5967/6952 co-relation queries the response was YES. [2025-03-15 00:36:38,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17121 conditions, 3054 events. 859/3054 cut-off events. For 5967/6952 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15683 event pairs, 858 based on Foata normal form. 0/2765 useless extension candidates. Maximal degree in co-relation 14758. Up to 2003 conditions per place. [2025-03-15 00:36:38,658 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 53 selfloop transitions, 9 changer transitions 2/500 dead transitions. [2025-03-15 00:36:38,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 500 transitions, 4251 flow [2025-03-15 00:36:38,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:36:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:36:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4168 transitions. [2025-03-15 00:36:38,664 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9489981785063752 [2025-03-15 00:36:38,664 INFO L298 CegarLoopForPetriNet]: 488 programPoint places, 25 predicate places. [2025-03-15 00:36:38,664 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 500 transitions, 4251 flow [2025-03-15 00:36:38,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 461.7) internal successors, (4617), 10 states have internal predecessors, (4617), 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:38,666 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:38,666 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:36:38,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-15 00:36:38,866 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:36:38,867 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-15 00:36:38,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1820236185, now seen corresponding path program 2 times [2025-03-15 00:36:38,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:38,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513083030] [2025-03-15 00:36:38,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:36:38,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:38,934 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:36:38,936 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:36:39,165 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:36:39,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:39,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513083030] [2025-03-15 00:36:39,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513083030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:36:39,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:36:39,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:36:39,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8771865] [2025-03-15 00:36:39,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:36:39,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:36:39,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:39,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:36:39,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:36:39,168 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 488 [2025-03-15 00:36:39,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 500 transitions, 4251 flow. Second operand has 6 states, 6 states have (on average 291.8333333333333) internal successors, (1751), 6 states have internal predecessors, (1751), 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:39,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:39,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 488 [2025-03-15 00:36:39,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:41,069 INFO L124 PetriNetUnfolderBase]: 1523/4794 cut-off events. [2025-03-15 00:36:41,070 INFO L125 PetriNetUnfolderBase]: For 11583/13550 co-relation queries the response was YES. [2025-03-15 00:36:41,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31525 conditions, 4794 events. 1523/4794 cut-off events. For 11583/13550 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 30810 event pairs, 115 based on Foata normal form. 0/4333 useless extension candidates. Maximal degree in co-relation 28950. Up to 3348 conditions per place. [2025-03-15 00:36:41,092 INFO L140 encePairwiseOnDemand]: 459/488 looper letters, 309 selfloop transitions, 75 changer transitions 2/673 dead transitions. [2025-03-15 00:36:41,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 673 transitions, 7777 flow [2025-03-15 00:36:41,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:36:41,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:36:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2036 transitions. [2025-03-15 00:36:41,095 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6953551912568307 [2025-03-15 00:36:41,095 INFO L298 CegarLoopForPetriNet]: 488 programPoint places, 29 predicate places. [2025-03-15 00:36:41,096 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 673 transitions, 7777 flow [2025-03-15 00:36:41,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 291.8333333333333) internal successors, (1751), 6 states have internal predecessors, (1751), 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:41,096 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:41,097 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, 1, 1, 1, 1, 1, 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:41,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:36:41,097 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-15 00:36:41,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:41,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1970437980, now seen corresponding path program 1 times [2025-03-15 00:36:41,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:41,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136814529] [2025-03-15 00:36:41,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:36:41,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:36:41,635 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:36:41,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:41,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136814529] [2025-03-15 00:36:41,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136814529] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:36:41,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581905011] [2025-03-15 00:36:41,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:36:41,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:36:41,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:36:41,639 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:36:41,640 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:36:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:36:42,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 1878 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-15 00:36:42,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:36:42,452 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:36:42,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:36:42,841 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:36:42,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581905011] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:36:42,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:36:42,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-15 00:36:42,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926627587] [2025-03-15 00:36:42,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:36:42,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-15 00:36:42,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:42,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-15 00:36:42,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-15 00:36:42,849 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 456 out of 488 [2025-03-15 00:36:42,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 673 transitions, 7777 flow. Second operand has 18 states, 18 states have (on average 462.94444444444446) internal successors, (8333), 18 states have internal predecessors, (8333), 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:42,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:42,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 456 of 488 [2025-03-15 00:36:42,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:45,015 INFO L124 PetriNetUnfolderBase]: 1523/5228 cut-off events. [2025-03-15 00:36:45,016 INFO L125 PetriNetUnfolderBase]: For 14542/16181 co-relation queries the response was YES. [2025-03-15 00:36:45,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34184 conditions, 5228 events. 1523/5228 cut-off events. For 14542/16181 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 30830 event pairs, 129 based on Foata normal form. 0/4767 useless extension candidates. Maximal degree in co-relation 29219. Up to 3540 conditions per place. [2025-03-15 00:36:45,047 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 119 selfloop transitions, 21 changer transitions 2/741 dead transitions. [2025-03-15 00:36:45,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 741 transitions, 9209 flow [2025-03-15 00:36:45,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-15 00:36:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-15 00:36:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 9710 transitions. [2025-03-15 00:36:45,059 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9475019516003123 [2025-03-15 00:36:45,060 INFO L298 CegarLoopForPetriNet]: 488 programPoint places, 49 predicate places. [2025-03-15 00:36:45,060 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 741 transitions, 9209 flow [2025-03-15 00:36:45,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 462.94444444444446) internal successors, (8333), 18 states have internal predecessors, (8333), 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:45,062 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:45,063 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] [2025-03-15 00:36:45,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-15 00:36:45,263 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:36:45,263 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-15 00:36:45,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:45,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1861836312, now seen corresponding path program 2 times [2025-03-15 00:36:45,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:45,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898825067] [2025-03-15 00:36:45,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:36:45,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:45,397 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:36:45,397 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:36:45,838 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:36:45,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:45,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898825067] [2025-03-15 00:36:45,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898825067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:36:45,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:36:45,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:36:45,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646852243] [2025-03-15 00:36:45,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:36:45,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:36:45,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:45,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:36:45,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:36:45,840 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 488 [2025-03-15 00:36:45,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 741 transitions, 9209 flow. Second operand has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 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:45,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:45,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 488 [2025-03-15 00:36:45,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:48,111 INFO L124 PetriNetUnfolderBase]: 1523/5217 cut-off events. [2025-03-15 00:36:48,111 INFO L125 PetriNetUnfolderBase]: For 17502/19817 co-relation queries the response was YES. [2025-03-15 00:36:48,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37695 conditions, 5217 events. 1523/5217 cut-off events. For 17502/19817 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 30772 event pairs, 115 based on Foata normal form. 0/4757 useless extension candidates. Maximal degree in co-relation 32332. Up to 3539 conditions per place. [2025-03-15 00:36:48,138 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 426 selfloop transitions, 5 changer transitions 2/740 dead transitions. [2025-03-15 00:36:48,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 740 transitions, 10053 flow [2025-03-15 00:36:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:36:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:36:48,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1860 transitions. [2025-03-15 00:36:48,141 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6352459016393442 [2025-03-15 00:36:48,141 INFO L298 CegarLoopForPetriNet]: 488 programPoint places, 53 predicate places. [2025-03-15 00:36:48,141 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 740 transitions, 10053 flow [2025-03-15 00:36:48,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 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:48,142 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:48,142 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, 1, 1, 1, 1, 1, 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:48,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:36:48,142 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-15 00:36:48,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:48,144 INFO L85 PathProgramCache]: Analyzing trace with hash 42095620, now seen corresponding path program 1 times [2025-03-15 00:36:48,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:48,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250452824] [2025-03-15 00:36:48,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:36:48,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:36:49,321 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:36:49,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:49,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250452824] [2025-03-15 00:36:49,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250452824] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:36:49,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997352918] [2025-03-15 00:36:49,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:36:49,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:36:49,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:36:49,323 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:36:49,325 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:36:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:36:49,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 3788 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-15 00:36:49,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:36:50,522 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:36:50,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:36:51,143 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:36:51,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997352918] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:36:51,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:36:51,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-15 00:36:51,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60680431] [2025-03-15 00:36:51,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:36:51,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-15 00:36:51,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:51,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-15 00:36:51,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-15 00:36:51,151 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 456 out of 488 [2025-03-15 00:36:51,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 740 transitions, 10053 flow. Second operand has 23 states, 23 states have (on average 463.7391304347826) internal successors, (10666), 23 states have internal predecessors, (10666), 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:51,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:51,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 456 of 488 [2025-03-15 00:36:51,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:54,410 INFO L124 PetriNetUnfolderBase]: 1523/5555 cut-off events. [2025-03-15 00:36:54,411 INFO L125 PetriNetUnfolderBase]: For 21204/23170 co-relation queries the response was YES. [2025-03-15 00:36:54,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40041 conditions, 5555 events. 1523/5555 cut-off events. For 21204/23170 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 31000 event pairs, 129 based on Foata normal form. 0/5095 useless extension candidates. Maximal degree in co-relation 32611. Up to 3683 conditions per place. [2025-03-15 00:36:54,436 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 161 selfloop transitions, 30 changer transitions 2/791 dead transitions. [2025-03-15 00:36:54,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 791 transitions, 11473 flow [2025-03-15 00:36:54,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-15 00:36:54,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-15 00:36:54,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 13864 transitions. [2025-03-15 00:36:54,446 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9469945355191257 [2025-03-15 00:36:54,446 INFO L298 CegarLoopForPetriNet]: 488 programPoint places, 82 predicate places. [2025-03-15 00:36:54,446 INFO L471 AbstractCegarLoop]: Abstraction has has 570 places, 791 transitions, 11473 flow [2025-03-15 00:36:54,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 463.7391304347826) internal successors, (10666), 23 states have internal predecessors, (10666), 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:54,449 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:54,449 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:36:54,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-15 00:36:54,650 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:36:54,650 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-15 00:36:54,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:54,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1887765797, now seen corresponding path program 2 times [2025-03-15 00:36:54,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:54,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62833068] [2025-03-15 00:36:54,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:36:54,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:54,787 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:36:54,787 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:36:55,123 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:55,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:55,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62833068] [2025-03-15 00:36:55,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62833068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:36:55,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:36:55,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:36:55,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690971475] [2025-03-15 00:36:55,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:36:55,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:36:55,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:55,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:36:55,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:36:55,125 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 488 [2025-03-15 00:36:55,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 791 transitions, 11473 flow. Second operand has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 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:55,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:55,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 488 [2025-03-15 00:36:55,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:58,791 INFO L124 PetriNetUnfolderBase]: 1817/6132 cut-off events. [2025-03-15 00:36:58,791 INFO L125 PetriNetUnfolderBase]: For 32397/37511 co-relation queries the response was YES. [2025-03-15 00:36:58,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48485 conditions, 6132 events. 1817/6132 cut-off events. For 32397/37511 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 35055 event pairs, 203 based on Foata normal form. 0/5645 useless extension candidates. Maximal degree in co-relation 40542. Up to 4091 conditions per place. [2025-03-15 00:36:58,822 INFO L140 encePairwiseOnDemand]: 465/488 looper letters, 595 selfloop transitions, 134 changer transitions 2/1091 dead transitions. [2025-03-15 00:36:58,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 1091 transitions, 19009 flow [2025-03-15 00:36:58,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:36:58,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:36:58,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2097 transitions. [2025-03-15 00:36:58,825 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7161885245901639 [2025-03-15 00:36:58,825 INFO L298 CegarLoopForPetriNet]: 488 programPoint places, 87 predicate places. [2025-03-15 00:36:58,825 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 1091 transitions, 19009 flow [2025-03-15 00:36:58,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 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:58,826 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:58,826 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, 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:58,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 00:36:58,826 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-15 00:36:58,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:58,828 INFO L85 PathProgramCache]: Analyzing trace with hash 585752533, now seen corresponding path program 1 times [2025-03-15 00:36:58,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:58,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692063728] [2025-03-15 00:36:58,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:36:58,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:01,756 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:37:01,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:01,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692063728] [2025-03-15 00:37:01,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692063728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:01,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:01,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:37:01,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613023332] [2025-03-15 00:37:01,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:01,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:37:01,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:01,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:37:01,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:37:01,758 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 488 [2025-03-15 00:37:01,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 1091 transitions, 19009 flow. Second operand has 6 states, 6 states have (on average 312.6666666666667) internal successors, (1876), 6 states have internal predecessors, (1876), 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:37:01,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:01,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 488 [2025-03-15 00:37:01,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:06,243 INFO L124 PetriNetUnfolderBase]: 2184/7015 cut-off events. [2025-03-15 00:37:06,243 INFO L125 PetriNetUnfolderBase]: For 48845/54797 co-relation queries the response was YES. [2025-03-15 00:37:06,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59758 conditions, 7015 events. 2184/7015 cut-off events. For 48845/54797 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 42509 event pairs, 315 based on Foata normal form. 0/6505 useless extension candidates. Maximal degree in co-relation 51297. Up to 4648 conditions per place. [2025-03-15 00:37:06,284 INFO L140 encePairwiseOnDemand]: 465/488 looper letters, 858 selfloop transitions, 135 changer transitions 43/1392 dead transitions. [2025-03-15 00:37:06,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 1392 transitions, 27799 flow [2025-03-15 00:37:06,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:37:06,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:37:06,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2078 transitions. [2025-03-15 00:37:06,285 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7096994535519126 [2025-03-15 00:37:06,286 INFO L298 CegarLoopForPetriNet]: 488 programPoint places, 92 predicate places. [2025-03-15 00:37:06,286 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 1392 transitions, 27799 flow [2025-03-15 00:37:06,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 312.6666666666667) internal successors, (1876), 6 states have internal predecessors, (1876), 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:37:06,286 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:06,287 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, 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:37:06,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 00:37:06,287 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-15 00:37:06,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:06,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1292764922, now seen corresponding path program 1 times [2025-03-15 00:37:06,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:06,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057446022] [2025-03-15 00:37:06,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:06,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:09,194 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:37:09,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:09,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057446022] [2025-03-15 00:37:09,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057446022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:09,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:09,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:37:09,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967848672] [2025-03-15 00:37:09,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:09,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:37:09,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:09,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:37:09,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:37:09,196 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 488 [2025-03-15 00:37:09,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 1392 transitions, 27799 flow. Second operand has 6 states, 6 states have (on average 311.3333333333333) internal successors, (1868), 6 states have internal predecessors, (1868), 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:37:09,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:09,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 488 [2025-03-15 00:37:09,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:14,228 INFO L124 PetriNetUnfolderBase]: 2584/7913 cut-off events. [2025-03-15 00:37:14,228 INFO L125 PetriNetUnfolderBase]: For 72898/79274 co-relation queries the response was YES. [2025-03-15 00:37:14,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71322 conditions, 7913 events. 2584/7913 cut-off events. For 72898/79274 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 49442 event pairs, 463 based on Foata normal form. 26/7393 useless extension candidates. Maximal degree in co-relation 62349. Up to 5132 conditions per place. [2025-03-15 00:37:14,280 INFO L140 encePairwiseOnDemand]: 469/488 looper letters, 1002 selfloop transitions, 115 changer transitions 43/1519 dead transitions. [2025-03-15 00:37:14,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 1519 transitions, 33243 flow [2025-03-15 00:37:14,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:37:14,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:37:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2010 transitions. [2025-03-15 00:37:14,282 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6864754098360656 [2025-03-15 00:37:14,282 INFO L298 CegarLoopForPetriNet]: 488 programPoint places, 97 predicate places. [2025-03-15 00:37:14,282 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 1519 transitions, 33243 flow [2025-03-15 00:37:14,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 311.3333333333333) internal successors, (1868), 6 states have internal predecessors, (1868), 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:37:14,283 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:14,283 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, 1, 1, 1, 1, 1, 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:37:14,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 00:37:14,283 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-15 00:37:14,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:14,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1623366364, now seen corresponding path program 1 times [2025-03-15 00:37:14,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:14,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162431007] [2025-03-15 00:37:14,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:14,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 0 proven. 1539 refuted. 0 times theorem prover too weak. 3241 trivial. 0 not checked. [2025-03-15 00:37:31,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:31,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162431007] [2025-03-15 00:37:31,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162431007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:37:31,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154263828] [2025-03-15 00:37:31,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:31,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:37:31,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:37:31,015 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:37:31,016 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:37:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:32,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 5102 conjuncts, 112 conjuncts are in the unsatisfiable core [2025-03-15 00:37:32,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:37:32,577 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 00:37:32,578 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:37:32,737 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 00:37:32,738 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:37:32,995 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 00:37:32,996 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:37:33,135 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 00:37:33,136 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:37:33,374 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-15 00:37:33,374 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:37:33,745 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-15 00:37:33,745 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:37:34,659 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-15 00:37:34,659 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:37:35,407 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-15 00:37:35,407 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:37:36,786 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-15 00:37:36,786 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:37:37,575 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-15 00:37:37,575 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:37:38,876 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-15 00:37:38,877 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:37:39,565 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-15 00:37:39,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-03-15 00:37:41,066 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-15 00:37:41,066 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:37:41,742 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-15 00:37:41,743 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:37:43,115 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-15 00:37:43,115 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:37:43,810 INFO L349 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2025-03-15 00:37:43,810 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:37:45,867 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-15 00:37:45,868 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:37:46,969 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-15 00:37:46,969 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:37:49,034 INFO L349 Elim1Store]: treesize reduction 70, result has 27.1 percent of original size [2025-03-15 00:37:49,034 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:37:50,101 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-15 00:37:50,101 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:37:52,857 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-15 00:37:52,857 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:37:54,766 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-15 00:37:54,767 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:37:57,222 INFO L349 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2025-03-15 00:37:57,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 39 [2025-03-15 00:37:57,285 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:57,314 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:57,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:37:57,345 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:57,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:37:57,385 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:57,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2025-03-15 00:37:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 3604 proven. 167 refuted. 0 times theorem prover too weak. 1009 trivial. 0 not checked. [2025-03-15 00:37:57,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:37:57,504 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse0 1)) 0)) (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse0)) 0)))) is different from false [2025-03-15 00:37:57,521 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_12033 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1)) 0)) (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1)) 0)) (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) .cse2) 0)) (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1)) 0)))))) is different from false [2025-03-15 00:38:01,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:38:01,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2025-03-15 00:38:01,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:38:01,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39 [2025-03-15 00:38:01,289 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:01,297 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-15 00:38:01,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2025-03-15 00:38:01,302 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-15 00:38:01,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-03-15 00:38:01,306 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-15 00:38:01,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-03-15 00:38:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 3646 proven. 0 refuted. 0 times theorem prover too weak. 1134 trivial. 0 not checked. [2025-03-15 00:38:06,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154263828] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-15 00:38:06,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-15 00:38:06,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [22, 21] total 50 [2025-03-15 00:38:06,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838519037] [2025-03-15 00:38:06,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:38:06,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 00:38:06,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:38:06,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 00:38:06,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=1868, Unknown=84, NotChecked=190, Total=2550 [2025-03-15 00:38:06,682 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 488 [2025-03-15 00:38:06,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 1519 transitions, 33243 flow. Second operand has 15 states, 15 states have (on average 283.6) internal successors, (4254), 15 states have internal predecessors, (4254), 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:06,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:38:06,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 488 [2025-03-15 00:38:06,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:38:09,088 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse6 (+ |c_~#slot~0.offset| .cse5 1)) (.cse7 (+ |c_~#slot~0.offset| 2 .cse5)) (.cse4 (+ |c_~#slot~0.offset| 3 .cse5))) (let ((.cse3 (store |c_#race| |c_~#slot~0.base| (store (store (store (select |c_#race| |c_~#slot~0.base|) .cse6 0) .cse7 0) .cse4 0)))) (and (forall ((|v_ULTIMATE.start_new_#t~malloc30#1.base_208| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_172| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_212| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_216| Int)) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_new_#t~malloc30#1.base_216| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_new_#t~malloc30#1.base_212| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_new_#t~malloc30#1.base_208| 1))) (or (not (= (select .cse0 |v_ULTIMATE.start_new_#t~malloc30#1.base_208|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_new_#t~malloc30#1.base_216|) 0)) (not (= (select (store .cse1 |v_ULTIMATE.start_new_#t~malloc30#1.base_172| 1) 2) 0)) (not (= (select .cse1 |v_ULTIMATE.start_new_#t~malloc30#1.base_172|) 0)) (not (= (select .cse2 |v_ULTIMATE.start_new_#t~malloc30#1.base_212|) 0))))))) (not (= (select |c_#valid| |c_~#slot~0.base|) 0)) (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store .cse3 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) .cse4) 0)) (not (= |c_~#slot~0.base| |c_t_funThread1of1ForFork0_new_~p~0#1.base|)) (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store .cse3 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse5)) 0)) (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store .cse3 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) .cse6) 0)) (not (= |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| |c_~#slot~0.base|)) (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store .cse3 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) .cse7) 0)))))) is different from false [2025-03-15 00:38:09,131 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse6 (+ |c_~#slot~0.offset| .cse5 1)) (.cse7 (+ |c_~#slot~0.offset| 2 .cse5)) (.cse4 (+ |c_~#slot~0.offset| 3 .cse5))) (let ((.cse3 (store |c_#race| |c_~#slot~0.base| (store (store (store (select |c_#race| |c_~#slot~0.base|) .cse6 0) .cse7 0) .cse4 0)))) (and (forall ((|v_ULTIMATE.start_new_#t~malloc30#1.base_208| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_172| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_212| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_216| Int)) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_new_#t~malloc30#1.base_216| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_new_#t~malloc30#1.base_212| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_new_#t~malloc30#1.base_208| 1))) (or (not (= (select .cse0 |v_ULTIMATE.start_new_#t~malloc30#1.base_208|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_new_#t~malloc30#1.base_216|) 0)) (not (= (select (store .cse1 |v_ULTIMATE.start_new_#t~malloc30#1.base_172| 1) 2) 0)) (not (= (select .cse1 |v_ULTIMATE.start_new_#t~malloc30#1.base_172|) 0)) (not (= (select .cse2 |v_ULTIMATE.start_new_#t~malloc30#1.base_212|) 0))))))) (not (= (select |c_#valid| |c_~#slot~0.base|) 0)) (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store .cse3 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) .cse4) 0)) (not (= |c_~#slot~0.base| |c_t_funThread1of1ForFork0_new_~p~0#1.base|)) (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store .cse3 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse5)) 0)) (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store .cse3 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) .cse6) 0)) (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store .cse3 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) .cse7) 0)))))) is different from false [2025-03-15 00:38:23,739 INFO L124 PetriNetUnfolderBase]: 6796/18631 cut-off events. [2025-03-15 00:38:23,740 INFO L125 PetriNetUnfolderBase]: For 198531/213194 co-relation queries the response was YES. [2025-03-15 00:38:23,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182573 conditions, 18631 events. 6796/18631 cut-off events. For 198531/213194 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 157492 event pairs, 811 based on Foata normal form. 110/17374 useless extension candidates. Maximal degree in co-relation 173027. Up to 12311 conditions per place. [2025-03-15 00:38:23,889 INFO L140 encePairwiseOnDemand]: 448/488 looper letters, 2692 selfloop transitions, 365 changer transitions 79/3444 dead transitions. [2025-03-15 00:38:23,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 3444 transitions, 88673 flow [2025-03-15 00:38:23,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-15 00:38:23,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-15 00:38:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6704 transitions. [2025-03-15 00:38:23,893 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5972915181753385 [2025-03-15 00:38:23,893 INFO L298 CegarLoopForPetriNet]: 488 programPoint places, 119 predicate places. [2025-03-15 00:38:23,893 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 3444 transitions, 88673 flow [2025-03-15 00:38:23,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 283.6) internal successors, (4254), 15 states have internal predecessors, (4254), 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,894 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:38:23,894 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, 1, 1, 1, 1, 1, 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,912 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,095 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,095 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-15 00:38:24,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:38:24,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2078041528, now seen corresponding path program 2 times [2025-03-15 00:38:24,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:38:24,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644906761] [2025-03-15 00:38:24,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:38:24,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:38:26,165 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 00:38:26,165 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:38:39,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 150 proven. 45 refuted. 0 times theorem prover too weak. 4585 trivial. 0 not checked. [2025-03-15 00:38:39,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:38:39,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644906761] [2025-03-15 00:38:39,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644906761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:38:39,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619203248] [2025-03-15 00:38:39,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:38:39,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:38:39,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:38:39,411 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:38:39,413 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:38:48,357 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 00:38:48,357 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:38:48,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 5102 conjuncts, 118 conjuncts are in the unsatisfiable core [2025-03-15 00:38:48,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:38:48,503 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-15 00:38:48,503 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:38:48,743 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:38:48,743 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:38:49,181 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-03-15 00:38:49,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2025-03-15 00:38:49,435 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-03-15 00:38:49,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2025-03-15 00:38:49,889 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-03-15 00:38:49,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2025-03-15 00:38:50,147 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-03-15 00:38:50,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2025-03-15 00:38:50,602 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:38:50,602 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:38:50,853 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-03-15 00:38:50,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2025-03-15 00:38:51,350 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-15 00:38:51,350 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:38:51,786 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-15 00:38:51,786 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:38:53,109 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-15 00:38:53,109 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:38:53,794 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-15 00:38:53,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-03-15 00:38:55,091 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-15 00:38:55,092 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:38:55,804 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-15 00:38:55,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-03-15 00:38:57,069 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-15 00:38:57,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-03-15 00:38:57,829 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-15 00:38:57,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-03-15 00:38:59,074 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-15 00:38:59,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-03-15 00:38:59,773 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-15 00:38:59,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-03-15 00:39:01,059 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-15 00:39:01,060 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:01,729 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-15 00:39:01,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-03-15 00:39:03,417 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-15 00:39:03,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-03-15 00:39:04,864 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-15 00:39:04,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-03-15 00:39:06,432 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:39:06,525 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:39:06,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:39:06,605 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:39:06,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:39:06,695 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:39:06,810 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2025-03-15 00:39:06,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2025-03-15 00:39:06,922 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:39:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 2845 proven. 22 refuted. 0 times theorem prover too weak. 1913 trivial. 0 not checked. [2025-03-15 00:39:06,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:39:07,063 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (forall ((v_ArrVal_14801 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_14801) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse0 1)) 0)) (forall ((v_ArrVal_14801 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_14801) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_14801 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_14801) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_14801 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_14801) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse0)) 0)))) is different from false [2025-03-15 00:39:15,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:39:15,534 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:39:15,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:39:15,538 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:39:15,542 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:39:15,547 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-15 00:39:15,547 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:39:15,551 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-15 00:39:15,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-03-15 00:39:15,554 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-15 00:39:15,554 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:39:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 2764 proven. 0 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-15 00:39:29,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619203248] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-15 00:39:29,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-15 00:39:29,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [28, 21] total 57 [2025-03-15 00:39:29,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392852011] [2025-03-15 00:39:29,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:39:29,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 00:39:29,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:39:29,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 00:39:29,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=2681, Unknown=26, NotChecked=110, Total=3306 [2025-03-15 00:39:29,401 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 488 [2025-03-15 00:39:29,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 3444 transitions, 88673 flow. Second operand has 14 states, 14 states have (on average 279.2142857142857) internal successors, (3909), 14 states have internal predecessors, (3909), 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:39:29,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:39:29,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 488 [2025-03-15 00:39:29,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:39:33,560 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse0 (select |c_#race| |c_~#slot~0.base|)) (.cse2 (+ |c_~#slot~0.offset| 3 .cse8))) (let ((.cse4 (+ |c_~#slot~0.offset| 2 .cse8)) (.cse1 (+ |c_~#slot~0.offset| .cse8 1)) (.cse3 (store |c_#race| |c_~#slot~0.base| (store .cse0 .cse2 0))) (.cse5 (+ |c_~#slot~0.offset| .cse8))) (and (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 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_14801 (Array Int Int))) (= (select (select (store .cse3 |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19| v_ArrVal_14801) |c_~#slot~0.base|) .cse4) 0)))) (= (select .cse0 .cse4) 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_14801 (Array Int Int))) (= (select (select (store |c_#race| |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19| v_ArrVal_14801) |c_~#slot~0.base|) .cse4) 0)))) (not (= (select |c_#valid| |c_~#slot~0.base|) 0)) (forall ((v_ArrVal_14801 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_14801) |c_~#slot~0.base|) .cse5) 0)) (forall ((v_ArrVal_14801 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_14801) |c_~#slot~0.base|) .cse2) 0)) (forall ((|v_ULTIMATE.start_new_#t~malloc30#1.base_305| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_309| Int) (|v_ULTIMATE.start_new_#t~malloc30#1.base_341| Int)) (let ((.cse7 (store |c_#valid| |v_ULTIMATE.start_new_#t~malloc30#1.base_341| 1))) (let ((.cse6 (store .cse7 |v_ULTIMATE.start_new_#t~malloc30#1.base_309| 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_new_#t~malloc30#1.base_341|) 0)) (not (= (select (store .cse6 |v_ULTIMATE.start_new_#t~malloc30#1.base_305| 1) 2) 0)) (not (= (select .cse6 |v_ULTIMATE.start_new_#t~malloc30#1.base_305|) 0)) (not (= (select .cse7 |v_ULTIMATE.start_new_#t~malloc30#1.base_309|) 0)))))) (forall ((v_ArrVal_14801 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_14801) |c_~#slot~0.base|) .cse4) 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_14801 (Array Int Int))) (= (select (select (store |c_#race| |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19| v_ArrVal_14801) |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_14801 (Array Int Int))) (= (select (select (store |c_#race| |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19| v_ArrVal_14801) |c_~#slot~0.base|) .cse2) 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_14801 (Array Int Int))) (= (select (select (store .cse3 |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19| v_ArrVal_14801) |c_~#slot~0.base|) .cse1) 0)))) (= 0 (select .cse0 .cse5)) (forall ((|v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19| Int)) (or (forall ((v_ArrVal_14801 (Array Int Int))) (= (select (select (store .cse3 |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19| v_ArrVal_14801) |c_~#slot~0.base|) .cse2) 0)) (not (= (select |c_#valid| |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19|) 0)))) (forall ((v_ArrVal_14801 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_14801) |c_~#slot~0.base|) .cse1) 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_14801 (Array Int Int))) (= (select (select (store |c_#race| |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19| v_ArrVal_14801) |c_~#slot~0.base|) .cse1) 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_14801 (Array Int Int))) (= (select (select (store .cse3 |v_t_funThread1of1ForFork0_new_#t~malloc30#1.base_19| v_ArrVal_14801) |c_~#slot~0.base|) .cse5) 0)))))))) is different from false [2025-03-15 00:40:08,327 INFO L124 PetriNetUnfolderBase]: 10074/27190 cut-off events. [2025-03-15 00:40:08,328 INFO L125 PetriNetUnfolderBase]: For 323086/342802 co-relation queries the response was YES. [2025-03-15 00:40:08,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285232 conditions, 27190 events. 10074/27190 cut-off events. For 323086/342802 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 254282 event pairs, 1112 based on Foata normal form. 358/25531 useless extension candidates. Maximal degree in co-relation 275113. Up to 17984 conditions per place. [2025-03-15 00:40:08,589 INFO L140 encePairwiseOnDemand]: 414/488 looper letters, 3678 selfloop transitions, 948 changer transitions 114/5048 dead transitions. [2025-03-15 00:40:08,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 5048 transitions, 141549 flow [2025-03-15 00:40:08,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-15 00:40:08,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-15 00:40:08,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5473 transitions. [2025-03-15 00:40:08,592 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6230646630236795 [2025-03-15 00:40:08,593 INFO L298 CegarLoopForPetriNet]: 488 programPoint places, 136 predicate places. [2025-03-15 00:40:08,593 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 5048 transitions, 141549 flow [2025-03-15 00:40:08,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 279.2142857142857) internal successors, (3909), 14 states have internal predecessors, (3909), 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:08,594 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:40:08,594 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, 1, 1, 1, 1, 1, 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:08,623 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:08,794 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:08,795 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-15 00:40:08,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:40:08,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1542329412, now seen corresponding path program 3 times [2025-03-15 00:40:08,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:40:08,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834297888] [2025-03-15 00:40:08,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:40:08,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:40:17,270 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-15 00:40:17,270 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:41:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 780 proven. 712 refuted. 0 times theorem prover too weak. 3288 trivial. 0 not checked. [2025-03-15 00:41:07,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:41:07,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834297888] [2025-03-15 00:41:07,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834297888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:41:07,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670007995] [2025-03-15 00:41:07,640 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:41:07,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:41:07,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:41:07,642 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:07,643 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:50:24,407 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:50:24,411 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:50:25,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2025-03-15 00:50:25,607 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:50:25,653 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:50:25,654 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-15 00:50:25,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-15 00:50:25,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2025-03-15 00:50:25,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196228767] [2025-03-15 00:50:25,654 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-15 00:50:25,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-15 00:50:25,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:50:25,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-15 00:50:25,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=776, Unknown=0, NotChecked=0, Total=930 [2025-03-15 00:50:25,658 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 488 [2025-03-15 00:50:25,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 5048 transitions, 141549 flow. Second operand has 31 states, 31 states have (on average 190.58064516129033) internal successors, (5908), 31 states have internal predecessors, (5908), 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:50:25,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:50:25,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 488 [2025-03-15 00:50:25,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:50:25,666 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (36 of 37 remaining) [2025-03-15 00:50:25,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 00:50:25,666 WARN L596 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-03-15 00:50:25,668 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 37 remaining) [2025-03-15 00:50:25,668 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 37 remaining) [2025-03-15 00:50:25,668 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 37 remaining) [2025-03-15 00:50:25,668 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (32 of 37 remaining) [2025-03-15 00:50:25,668 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 37 remaining) [2025-03-15 00:50:25,668 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 37 remaining) [2025-03-15 00:50:25,668 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (29 of 37 remaining) [2025-03-15 00:50:25,668 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 37 remaining) [2025-03-15 00:50:25,668 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (27 of 37 remaining) [2025-03-15 00:50:25,668 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 37 remaining) [2025-03-15 00:50:25,668 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (25 of 37 remaining) [2025-03-15 00:50:25,668 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (24 of 37 remaining) [2025-03-15 00:50:25,668 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (23 of 37 remaining) [2025-03-15 00:50:25,668 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (22 of 37 remaining) [2025-03-15 00:50:25,668 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (21 of 37 remaining) [2025-03-15 00:50:25,669 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (20 of 37 remaining) [2025-03-15 00:50:25,669 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (19 of 37 remaining) [2025-03-15 00:50:25,669 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (18 of 37 remaining) [2025-03-15 00:50:25,669 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (17 of 37 remaining) [2025-03-15 00:50:25,669 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (16 of 37 remaining) [2025-03-15 00:50:25,669 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (15 of 37 remaining) [2025-03-15 00:50:25,669 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (14 of 37 remaining) [2025-03-15 00:50:25,669 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (13 of 37 remaining) [2025-03-15 00:50:25,669 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 37 remaining) [2025-03-15 00:50:25,669 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 37 remaining) [2025-03-15 00:50:25,669 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 37 remaining) [2025-03-15 00:50:25,669 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 37 remaining) [2025-03-15 00:50:25,669 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 37 remaining) [2025-03-15 00:50:25,669 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (7 of 37 remaining) [2025-03-15 00:50:25,669 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 37 remaining) [2025-03-15 00:50:25,669 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 37 remaining) [2025-03-15 00:50:25,669 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 37 remaining) [2025-03-15 00:50:25,669 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 37 remaining) [2025-03-15 00:50:25,669 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 37 remaining) [2025-03-15 00:50:25,669 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 37 remaining) [2025-03-15 00:50:25,669 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 37 remaining) [2025-03-15 00:50:25,670 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:50:25,673 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:50:25,673 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:50:25,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:50:25 BasicIcfg [2025-03-15 00:50:25,676 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:50:25,676 INFO L158 Benchmark]: Toolchain (without parser) took 841321.74ms. Allocated memory was 71.3MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 41.6MB in the beginning and 2.2GB in the end (delta: -2.2GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2025-03-15 00:50:25,676 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory is still 36.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:50:25,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.81ms. Allocated memory is still 71.3MB. Free memory was 41.4MB in the beginning and 22.8MB in the end (delta: 18.7MB). Peak memory consumption was 31.7MB. Max. memory is 8.0GB. [2025-03-15 00:50:25,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.29ms. Allocated memory is still 71.3MB. Free memory was 22.8MB in the beginning and 37.7MB in the end (delta: -15.0MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. [2025-03-15 00:50:25,677 INFO L158 Benchmark]: Boogie Preprocessor took 41.89ms. Allocated memory is still 71.3MB. Free memory was 37.7MB in the beginning and 32.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:50:25,677 INFO L158 Benchmark]: RCFGBuilder took 900.81ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 32.9MB in the beginning and 57.8MB in the end (delta: -24.8MB). Peak memory consumption was 34.5MB. Max. memory is 8.0GB. [2025-03-15 00:50:25,677 INFO L158 Benchmark]: TraceAbstraction took 839825.24ms. Allocated memory was 96.5MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 56.8MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2025-03-15 00:50:25,678 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.18ms. Allocated memory is still 71.3MB. Free memory is still 36.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 467.81ms. Allocated memory is still 71.3MB. Free memory was 41.4MB in the beginning and 22.8MB in the end (delta: 18.7MB). Peak memory consumption was 31.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 76.29ms. Allocated memory is still 71.3MB. Free memory was 22.8MB in the beginning and 37.7MB in the end (delta: -15.0MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.89ms. Allocated memory is still 71.3MB. Free memory was 37.7MB in the beginning and 32.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 900.81ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 32.9MB in the beginning and 57.8MB in the end (delta: -24.8MB). Peak memory consumption was 34.5MB. Max. memory is 8.0GB. * TraceAbstraction took 839825.24ms. Allocated memory was 96.5MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 56.8MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1270]: 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: 1241]: 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: 1267]: 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: 1270]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1271]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1268]: 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, 576 locations, 37 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 839.7s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 87.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 645 mSolverCounterUnknown, 1719 SdHoareTripleChecker+Valid, 15.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1719 mSDsluCounter, 3388 SdHoareTripleChecker+Invalid, 13.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2786 IncrementalHoareTripleChecker+Unchecked, 926 mSDsCounter, 611 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11047 IncrementalHoareTripleChecker+Invalid, 15090 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 611 mSolverCounterUnsat, 2462 mSDtfsCounter, 11047 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 645 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9208 GetRequests, 8835 SyntacticMatches, 85 SemanticMatches, 288 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 6597 ImplicationChecksByTransitivity, 29.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141549occurred in iteration=18, InterpolantAutomatonStates: 176, 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.8s SsaConstructionTime, 23.4s SatisfiabilityAnalysisTime, 166.4s InterpolantComputationTime, 16421 NumberOfCodeBlocks, 14301 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 20769 ConstructedInterpolants, 3556 QuantifiedInterpolants, 229243 SizeOfPredicates, 95 NumberOfNonLiveVariables, 16627 ConjunctsInSsa, 258 ConjunctsInUnsatCore, 29 InterpolantComputations, 15 PerfectInterpolantSequences, 47869/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