/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/weaver/security.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:04:59,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:04:59,775 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 01:04:59,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:04:59,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:04:59,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:04:59,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:04:59,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:04:59,815 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:04:59,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:04:59,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:04:59,815 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:04:59,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:04:59,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:04:59,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:04:59,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:04:59,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:04:59,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:04:59,816 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:04:59,816 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:04:59,816 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:04:59,816 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:04:59,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:04:59,816 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:04:59,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:04:59,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:04:59,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:04:59,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:04:59,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:04:59,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:04:59,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:04:59,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:04:59,817 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 01:05:00,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:05:00,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:05:00,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:05:00,075 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:05:00,075 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:05:00,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/security.wvr.c [2025-03-15 01:05:01,251 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87b132e2e/1fa27d3228fd4daebff4a16d5809d38f/FLAG4061e7ddf [2025-03-15 01:05:01,418 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:05:01,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/security.wvr.c [2025-03-15 01:05:01,424 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87b132e2e/1fa27d3228fd4daebff4a16d5809d38f/FLAG4061e7ddf [2025-03-15 01:05:01,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87b132e2e/1fa27d3228fd4daebff4a16d5809d38f [2025-03-15 01:05:01,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:05:01,830 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:05:01,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:05:01,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:05:01,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:05:01,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:05:01" (1/1) ... [2025-03-15 01:05:01,835 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c69a668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:01, skipping insertion in model container [2025-03-15 01:05:01,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:05:01" (1/1) ... [2025-03-15 01:05:01,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:05:01,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:05:01,977 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:05:01,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:05:02,003 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:05:02,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:02 WrapperNode [2025-03-15 01:05:02,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:05:02,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:05:02,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:05:02,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:05:02,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:02" (1/1) ... [2025-03-15 01:05:02,013 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:02" (1/1) ... [2025-03-15 01:05:02,025 INFO L138 Inliner]: procedures = 20, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 51 [2025-03-15 01:05:02,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:05:02,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:05:02,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:05:02,026 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:05:02,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:02" (1/1) ... [2025-03-15 01:05:02,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:02" (1/1) ... [2025-03-15 01:05:02,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:02" (1/1) ... [2025-03-15 01:05:02,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:02" (1/1) ... [2025-03-15 01:05:02,041 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:02" (1/1) ... [2025-03-15 01:05:02,042 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:02" (1/1) ... [2025-03-15 01:05:02,047 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:02" (1/1) ... [2025-03-15 01:05:02,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:02" (1/1) ... [2025-03-15 01:05:02,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:02" (1/1) ... [2025-03-15 01:05:02,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:05:02,049 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:05:02,050 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:05:02,050 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:05:02,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:02" (1/1) ... [2025-03-15 01:05:02,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:05:02,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:05:02,079 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 01:05:02,083 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 01:05:02,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:05:02,097 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 01:05:02,097 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 01:05:02,097 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 01:05:02,097 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 01:05:02,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:05:02,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:05:02,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:05:02,098 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 01:05:02,170 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:05:02,171 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:05:02,336 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:05:02,336 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:05:02,346 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:05:02,347 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:05:02,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:05:02 BoogieIcfgContainer [2025-03-15 01:05:02,347 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:05:02,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:05:02,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:05:02,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:05:02,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:05:01" (1/3) ... [2025-03-15 01:05:02,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ceb07b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:05:02, skipping insertion in model container [2025-03-15 01:05:02,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:02" (2/3) ... [2025-03-15 01:05:02,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ceb07b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:05:02, skipping insertion in model container [2025-03-15 01:05:02,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:05:02" (3/3) ... [2025-03-15 01:05:02,355 INFO L128 eAbstractionObserver]: Analyzing ICFG security.wvr.c [2025-03-15 01:05:02,366 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:05:02,367 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG security.wvr.c that has 3 procedures, 145 locations, 1 initial locations, 0 loop locations, and 17 error locations. [2025-03-15 01:05:02,368 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:05:02,430 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 01:05:02,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:05:02,471 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;@555b6487, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:05:02,471 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-03-15 01:05:02,489 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:05:02,490 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-03-15 01:05:02,491 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:05:02,491 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:02,491 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] [2025-03-15 01:05:02,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 01:05:02,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:02,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1652043013, now seen corresponding path program 1 times [2025-03-15 01:05:02,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:02,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764058352] [2025-03-15 01:05:02,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:02,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:02,593 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 01:05:02,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:02,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764058352] [2025-03-15 01:05:02,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764058352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:02,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:02,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:02,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759149716] [2025-03-15 01:05:02,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:02,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:02,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:02,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:02,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:02,625 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 147 [2025-03-15 01:05:02,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 147 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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 01:05:02,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:02,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 147 [2025-03-15 01:05:02,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:02,729 INFO L124 PetriNetUnfolderBase]: 18/247 cut-off events. [2025-03-15 01:05:02,729 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-15 01:05:02,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 247 events. 18/247 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 682 event pairs, 15 based on Foata normal form. 2/204 useless extension candidates. Maximal degree in co-relation 228. Up to 44 conditions per place. [2025-03-15 01:05:02,738 INFO L140 encePairwiseOnDemand]: 142/147 looper letters, 13 selfloop transitions, 2 changer transitions 9/136 dead transitions. [2025-03-15 01:05:02,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 136 transitions, 314 flow [2025-03-15 01:05:02,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:02,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:02,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2025-03-15 01:05:02,751 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9115646258503401 [2025-03-15 01:05:02,754 INFO L298 CegarLoopForPetriNet]: 151 programPoint places, -8 predicate places. [2025-03-15 01:05:02,754 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 136 transitions, 314 flow [2025-03-15 01:05:02,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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 01:05:02,754 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:02,754 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] [2025-03-15 01:05:02,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:05:02,755 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 01:05:02,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:02,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1233895533, now seen corresponding path program 1 times [2025-03-15 01:05:02,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:02,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76537817] [2025-03-15 01:05:02,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:02,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:02,808 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 01:05:02,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:02,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76537817] [2025-03-15 01:05:02,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76537817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:02,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:02,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:02,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489642043] [2025-03-15 01:05:02,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:02,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:02,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:02,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:02,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:02,811 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 147 [2025-03-15 01:05:02,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 136 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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 01:05:02,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:02,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 147 [2025-03-15 01:05:02,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:02,872 INFO L124 PetriNetUnfolderBase]: 25/248 cut-off events. [2025-03-15 01:05:02,872 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-15 01:05:02,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 248 events. 25/248 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 849 event pairs, 20 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 275. Up to 51 conditions per place. [2025-03-15 01:05:02,877 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 10 selfloop transitions, 2 changer transitions 9/136 dead transitions. [2025-03-15 01:05:02,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 136 transitions, 343 flow [2025-03-15 01:05:02,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:02,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:02,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2025-03-15 01:05:02,878 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9342403628117913 [2025-03-15 01:05:02,879 INFO L298 CegarLoopForPetriNet]: 151 programPoint places, -7 predicate places. [2025-03-15 01:05:02,879 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 136 transitions, 343 flow [2025-03-15 01:05:02,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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 01:05:02,879 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:02,879 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] [2025-03-15 01:05:02,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:05:02,880 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 01:05:02,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:02,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1432322502, now seen corresponding path program 1 times [2025-03-15 01:05:02,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:02,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175649558] [2025-03-15 01:05:02,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:02,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:02,927 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 01:05:02,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:02,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175649558] [2025-03-15 01:05:02,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175649558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:02,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:02,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:02,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369784263] [2025-03-15 01:05:02,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:02,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:02,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:02,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:02,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:02,938 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 147 [2025-03-15 01:05:02,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 136 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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 01:05:02,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:02,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 147 [2025-03-15 01:05:02,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:02,984 INFO L124 PetriNetUnfolderBase]: 34/325 cut-off events. [2025-03-15 01:05:02,984 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2025-03-15 01:05:02,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 325 events. 34/325 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1337 event pairs, 13 based on Foata normal form. 0/264 useless extension candidates. Maximal degree in co-relation 345. Up to 61 conditions per place. [2025-03-15 01:05:02,987 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 11 selfloop transitions, 2 changer transitions 9/136 dead transitions. [2025-03-15 01:05:02,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 136 transitions, 376 flow [2025-03-15 01:05:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2025-03-15 01:05:02,989 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9342403628117913 [2025-03-15 01:05:02,989 INFO L298 CegarLoopForPetriNet]: 151 programPoint places, -6 predicate places. [2025-03-15 01:05:02,989 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 136 transitions, 376 flow [2025-03-15 01:05:02,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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 01:05:02,990 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:02,990 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] [2025-03-15 01:05:02,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:05:02,990 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 01:05:02,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:02,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1053979864, now seen corresponding path program 1 times [2025-03-15 01:05:02,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:02,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992049451] [2025-03-15 01:05:02,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:02,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:03,028 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 01:05:03,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:03,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992049451] [2025-03-15 01:05:03,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992049451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:03,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:03,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:03,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696378605] [2025-03-15 01:05:03,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:03,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:03,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:03,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:03,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:03,030 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 147 [2025-03-15 01:05:03,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 136 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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 01:05:03,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:03,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 147 [2025-03-15 01:05:03,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:03,085 INFO L124 PetriNetUnfolderBase]: 53/417 cut-off events. [2025-03-15 01:05:03,085 INFO L125 PetriNetUnfolderBase]: For 490/498 co-relation queries the response was YES. [2025-03-15 01:05:03,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 417 events. 53/417 cut-off events. For 490/498 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2052 event pairs, 27 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 481. Up to 99 conditions per place. [2025-03-15 01:05:03,089 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 13 selfloop transitions, 1 changer transitions 9/139 dead transitions. [2025-03-15 01:05:03,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 139 transitions, 444 flow [2025-03-15 01:05:03,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:03,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:03,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2025-03-15 01:05:03,091 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9455782312925171 [2025-03-15 01:05:03,092 INFO L298 CegarLoopForPetriNet]: 151 programPoint places, -5 predicate places. [2025-03-15 01:05:03,092 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 139 transitions, 444 flow [2025-03-15 01:05:03,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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 01:05:03,093 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:03,093 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] [2025-03-15 01:05:03,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:05:03,093 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 01:05:03,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:03,093 INFO L85 PathProgramCache]: Analyzing trace with hash 708059466, now seen corresponding path program 1 times [2025-03-15 01:05:03,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:03,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478915261] [2025-03-15 01:05:03,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:03,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:03,130 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 01:05:03,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:03,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478915261] [2025-03-15 01:05:03,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478915261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:03,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:03,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:03,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791409645] [2025-03-15 01:05:03,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:03,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:03,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:03,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:03,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:03,132 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 147 [2025-03-15 01:05:03,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 139 transitions, 444 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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 01:05:03,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:03,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 147 [2025-03-15 01:05:03,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:03,222 INFO L124 PetriNetUnfolderBase]: 67/479 cut-off events. [2025-03-15 01:05:03,222 INFO L125 PetriNetUnfolderBase]: For 879/887 co-relation queries the response was YES. [2025-03-15 01:05:03,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 479 events. 67/479 cut-off events. For 879/887 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2551 event pairs, 24 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 617. Up to 115 conditions per place. [2025-03-15 01:05:03,225 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 19 selfloop transitions, 2 changer transitions 9/139 dead transitions. [2025-03-15 01:05:03,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 139 transitions, 497 flow [2025-03-15 01:05:03,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:03,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:03,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2025-03-15 01:05:03,226 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2025-03-15 01:05:03,226 INFO L298 CegarLoopForPetriNet]: 151 programPoint places, -4 predicate places. [2025-03-15 01:05:03,227 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 139 transitions, 497 flow [2025-03-15 01:05:03,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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 01:05:03,227 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:03,227 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] [2025-03-15 01:05:03,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:05:03,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 01:05:03,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:03,228 INFO L85 PathProgramCache]: Analyzing trace with hash 206179214, now seen corresponding path program 1 times [2025-03-15 01:05:03,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:03,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926821479] [2025-03-15 01:05:03,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:03,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:03,268 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 01:05:03,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:03,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926821479] [2025-03-15 01:05:03,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926821479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:03,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:03,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:03,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779459029] [2025-03-15 01:05:03,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:03,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:03,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:03,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:03,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:03,270 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 147 [2025-03-15 01:05:03,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 139 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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 01:05:03,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:03,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 147 [2025-03-15 01:05:03,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:03,339 INFO L124 PetriNetUnfolderBase]: 67/427 cut-off events. [2025-03-15 01:05:03,339 INFO L125 PetriNetUnfolderBase]: For 1158/1166 co-relation queries the response was YES. [2025-03-15 01:05:03,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 979 conditions, 427 events. 67/427 cut-off events. For 1158/1166 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2249 event pairs, 44 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 611. Up to 113 conditions per place. [2025-03-15 01:05:03,343 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 19 selfloop transitions, 2 changer transitions 9/139 dead transitions. [2025-03-15 01:05:03,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 139 transitions, 550 flow [2025-03-15 01:05:03,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:03,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:03,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2025-03-15 01:05:03,344 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9183673469387755 [2025-03-15 01:05:03,345 INFO L298 CegarLoopForPetriNet]: 151 programPoint places, -3 predicate places. [2025-03-15 01:05:03,345 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 139 transitions, 550 flow [2025-03-15 01:05:03,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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 01:05:03,346 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:03,346 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] [2025-03-15 01:05:03,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:05:03,346 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 01:05:03,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:03,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1215516512, now seen corresponding path program 1 times [2025-03-15 01:05:03,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:03,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445259758] [2025-03-15 01:05:03,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:03,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:03,382 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 01:05:03,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:03,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445259758] [2025-03-15 01:05:03,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445259758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:03,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:03,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:03,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245696067] [2025-03-15 01:05:03,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:03,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:03,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:03,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:03,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:03,384 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 147 [2025-03-15 01:05:03,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 139 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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 01:05:03,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:03,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 147 [2025-03-15 01:05:03,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:03,437 INFO L124 PetriNetUnfolderBase]: 66/472 cut-off events. [2025-03-15 01:05:03,438 INFO L125 PetriNetUnfolderBase]: For 1384/1392 co-relation queries the response was YES. [2025-03-15 01:05:03,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1077 conditions, 472 events. 66/472 cut-off events. For 1384/1392 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2504 event pairs, 30 based on Foata normal form. 0/381 useless extension candidates. Maximal degree in co-relation 683. Up to 114 conditions per place. [2025-03-15 01:05:03,440 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 19 selfloop transitions, 1 changer transitions 9/140 dead transitions. [2025-03-15 01:05:03,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 140 transitions, 618 flow [2025-03-15 01:05:03,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:03,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2025-03-15 01:05:03,442 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9251700680272109 [2025-03-15 01:05:03,444 INFO L298 CegarLoopForPetriNet]: 151 programPoint places, -2 predicate places. [2025-03-15 01:05:03,444 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 140 transitions, 618 flow [2025-03-15 01:05:03,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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 01:05:03,445 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:03,445 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] [2025-03-15 01:05:03,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:05:03,445 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 01:05:03,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:03,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1260704255, now seen corresponding path program 1 times [2025-03-15 01:05:03,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:03,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590615472] [2025-03-15 01:05:03,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:03,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:03,483 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 01:05:03,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:03,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590615472] [2025-03-15 01:05:03,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590615472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:03,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:03,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:03,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270786693] [2025-03-15 01:05:03,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:03,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:03,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:03,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:03,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:03,484 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 147 [2025-03-15 01:05:03,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 140 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 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 01:05:03,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:03,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 147 [2025-03-15 01:05:03,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:03,557 INFO L124 PetriNetUnfolderBase]: 84/658 cut-off events. [2025-03-15 01:05:03,558 INFO L125 PetriNetUnfolderBase]: For 2094/2158 co-relation queries the response was YES. [2025-03-15 01:05:03,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1428 conditions, 658 events. 84/658 cut-off events. For 2094/2158 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4034 event pairs, 49 based on Foata normal form. 2/526 useless extension candidates. Maximal degree in co-relation 882. Up to 168 conditions per place. [2025-03-15 01:05:03,561 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 21 selfloop transitions, 1 changer transitions 9/143 dead transitions. [2025-03-15 01:05:03,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 143 transitions, 734 flow [2025-03-15 01:05:03,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:03,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:03,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2025-03-15 01:05:03,563 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9433106575963719 [2025-03-15 01:05:03,564 INFO L298 CegarLoopForPetriNet]: 151 programPoint places, -1 predicate places. [2025-03-15 01:05:03,564 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 143 transitions, 734 flow [2025-03-15 01:05:03,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 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 01:05:03,564 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:03,564 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] [2025-03-15 01:05:03,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:05:03,564 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 01:05:03,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:03,565 INFO L85 PathProgramCache]: Analyzing trace with hash -119724766, now seen corresponding path program 1 times [2025-03-15 01:05:03,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:03,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105754843] [2025-03-15 01:05:03,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:03,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:03,595 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 01:05:03,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:03,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105754843] [2025-03-15 01:05:03,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105754843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:03,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:03,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:03,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71796563] [2025-03-15 01:05:03,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:03,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:03,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:03,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:03,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:03,597 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 147 [2025-03-15 01:05:03,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 143 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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 01:05:03,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:03,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 147 [2025-03-15 01:05:03,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:03,670 INFO L124 PetriNetUnfolderBase]: 58/506 cut-off events. [2025-03-15 01:05:03,670 INFO L125 PetriNetUnfolderBase]: For 2446/2516 co-relation queries the response was YES. [2025-03-15 01:05:03,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1259 conditions, 506 events. 58/506 cut-off events. For 2446/2516 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2797 event pairs, 16 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 728. Up to 106 conditions per place. [2025-03-15 01:05:03,673 INFO L140 encePairwiseOnDemand]: 143/147 looper letters, 26 selfloop transitions, 2 changer transitions 9/145 dead transitions. [2025-03-15 01:05:03,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 145 transitions, 832 flow [2025-03-15 01:05:03,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:03,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:03,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2025-03-15 01:05:03,674 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9319727891156463 [2025-03-15 01:05:03,675 INFO L298 CegarLoopForPetriNet]: 151 programPoint places, -1 predicate places. [2025-03-15 01:05:03,675 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 145 transitions, 832 flow [2025-03-15 01:05:03,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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 01:05:03,675 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:03,675 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] [2025-03-15 01:05:03,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:05:03,676 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 01:05:03,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:03,677 INFO L85 PathProgramCache]: Analyzing trace with hash 326439841, now seen corresponding path program 1 times [2025-03-15 01:05:03,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:03,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144597207] [2025-03-15 01:05:03,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:03,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:03,706 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 01:05:03,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:03,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144597207] [2025-03-15 01:05:03,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144597207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:03,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:03,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:03,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549681760] [2025-03-15 01:05:03,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:03,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:03,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:03,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:03,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:03,709 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 147 [2025-03-15 01:05:03,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 145 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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 01:05:03,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:03,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 147 [2025-03-15 01:05:03,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:03,780 INFO L124 PetriNetUnfolderBase]: 84/529 cut-off events. [2025-03-15 01:05:03,780 INFO L125 PetriNetUnfolderBase]: For 5054/5424 co-relation queries the response was YES. [2025-03-15 01:05:03,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 529 events. 84/529 cut-off events. For 5054/5424 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3183 event pairs, 29 based on Foata normal form. 4/443 useless extension candidates. Maximal degree in co-relation 1098. Up to 132 conditions per place. [2025-03-15 01:05:03,782 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 30 selfloop transitions, 2 changer transitions 9/146 dead transitions. [2025-03-15 01:05:03,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 146 transitions, 940 flow [2025-03-15 01:05:03,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:03,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2025-03-15 01:05:03,783 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2025-03-15 01:05:03,784 INFO L298 CegarLoopForPetriNet]: 151 programPoint places, 0 predicate places. [2025-03-15 01:05:03,784 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 146 transitions, 940 flow [2025-03-15 01:05:03,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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 01:05:03,784 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:03,784 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] [2025-03-15 01:05:03,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:05:03,784 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 01:05:03,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:03,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1458058907, now seen corresponding path program 1 times [2025-03-15 01:05:03,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:03,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543957115] [2025-03-15 01:05:03,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:03,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:03,804 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 01:05:03,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:03,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543957115] [2025-03-15 01:05:03,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543957115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:03,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:03,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:03,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307760335] [2025-03-15 01:05:03,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:03,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:03,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:03,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:03,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:03,805 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 147 [2025-03-15 01:05:03,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 146 transitions, 940 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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 01:05:03,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:03,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 147 [2025-03-15 01:05:03,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:03,870 INFO L124 PetriNetUnfolderBase]: 86/528 cut-off events. [2025-03-15 01:05:03,870 INFO L125 PetriNetUnfolderBase]: For 6205/7401 co-relation queries the response was YES. [2025-03-15 01:05:03,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1791 conditions, 528 events. 86/528 cut-off events. For 6205/7401 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3194 event pairs, 30 based on Foata normal form. 6/447 useless extension candidates. Maximal degree in co-relation 1202. Up to 134 conditions per place. [2025-03-15 01:05:03,874 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 31 selfloop transitions, 2 changer transitions 9/147 dead transitions. [2025-03-15 01:05:03,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 147 transitions, 1052 flow [2025-03-15 01:05:03,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:03,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:03,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2025-03-15 01:05:03,876 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9183673469387755 [2025-03-15 01:05:03,877 INFO L298 CegarLoopForPetriNet]: 151 programPoint places, 1 predicate places. [2025-03-15 01:05:03,877 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 147 transitions, 1052 flow [2025-03-15 01:05:03,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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 01:05:03,877 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:03,877 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] [2025-03-15 01:05:03,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:05:03,877 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 01:05:03,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:03,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1313807461, now seen corresponding path program 1 times [2025-03-15 01:05:03,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:03,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950236503] [2025-03-15 01:05:03,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:03,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:03,907 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 01:05:03,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:03,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950236503] [2025-03-15 01:05:03,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950236503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:03,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:03,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:03,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241974009] [2025-03-15 01:05:03,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:03,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:03,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:03,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:03,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:03,909 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 147 [2025-03-15 01:05:03,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 147 transitions, 1052 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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 01:05:03,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:03,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 147 [2025-03-15 01:05:03,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:03,976 INFO L124 PetriNetUnfolderBase]: 94/529 cut-off events. [2025-03-15 01:05:03,976 INFO L125 PetriNetUnfolderBase]: For 9533/10625 co-relation queries the response was YES. [2025-03-15 01:05:03,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2023 conditions, 529 events. 94/529 cut-off events. For 9533/10625 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3202 event pairs, 23 based on Foata normal form. 2/451 useless extension candidates. Maximal degree in co-relation 1267. Up to 142 conditions per place. [2025-03-15 01:05:03,979 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 31 selfloop transitions, 2 changer transitions 9/148 dead transitions. [2025-03-15 01:05:03,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 148 transitions, 1170 flow [2025-03-15 01:05:03,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:03,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2025-03-15 01:05:03,980 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9342403628117913 [2025-03-15 01:05:03,982 INFO L298 CegarLoopForPetriNet]: 151 programPoint places, 2 predicate places. [2025-03-15 01:05:03,983 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 148 transitions, 1170 flow [2025-03-15 01:05:03,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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 01:05:03,983 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:03,983 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] [2025-03-15 01:05:03,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:05:03,983 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 01:05:03,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:03,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1163742355, now seen corresponding path program 1 times [2025-03-15 01:05:03,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:03,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476670205] [2025-03-15 01:05:03,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:03,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:04,015 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 01:05:04,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:04,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476670205] [2025-03-15 01:05:04,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476670205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:04,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:04,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:04,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861814931] [2025-03-15 01:05:04,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:04,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:04,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:04,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:04,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:04,017 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 147 [2025-03-15 01:05:04,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 148 transitions, 1170 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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 01:05:04,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:04,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 147 [2025-03-15 01:05:04,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:04,070 INFO L124 PetriNetUnfolderBase]: 90/576 cut-off events. [2025-03-15 01:05:04,070 INFO L125 PetriNetUnfolderBase]: For 8994/10430 co-relation queries the response was YES. [2025-03-15 01:05:04,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2163 conditions, 576 events. 90/576 cut-off events. For 8994/10430 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3552 event pairs, 24 based on Foata normal form. 6/508 useless extension candidates. Maximal degree in co-relation 1267. Up to 142 conditions per place. [2025-03-15 01:05:04,073 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 35 selfloop transitions, 1 changer transitions 9/151 dead transitions. [2025-03-15 01:05:04,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 151 transitions, 1352 flow [2025-03-15 01:05:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:04,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2025-03-15 01:05:04,075 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9251700680272109 [2025-03-15 01:05:04,075 INFO L298 CegarLoopForPetriNet]: 151 programPoint places, 3 predicate places. [2025-03-15 01:05:04,075 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 151 transitions, 1352 flow [2025-03-15 01:05:04,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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 01:05:04,075 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:04,075 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] [2025-03-15 01:05:04,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:05:04,076 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 01:05:04,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:04,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1795930344, now seen corresponding path program 1 times [2025-03-15 01:05:04,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:04,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714268708] [2025-03-15 01:05:04,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:04,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:04,097 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 01:05:04,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:04,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714268708] [2025-03-15 01:05:04,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714268708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:04,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:04,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:04,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818021873] [2025-03-15 01:05:04,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:04,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:04,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:04,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:04,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:04,098 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 147 [2025-03-15 01:05:04,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 151 transitions, 1352 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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 01:05:04,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:04,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 147 [2025-03-15 01:05:04,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:04,163 INFO L124 PetriNetUnfolderBase]: 106/576 cut-off events. [2025-03-15 01:05:04,163 INFO L125 PetriNetUnfolderBase]: For 13092/14308 co-relation queries the response was YES. [2025-03-15 01:05:04,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2562 conditions, 576 events. 106/576 cut-off events. For 13092/14308 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3672 event pairs, 18 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 1611. Up to 158 conditions per place. [2025-03-15 01:05:04,168 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 38 selfloop transitions, 2 changer transitions 9/154 dead transitions. [2025-03-15 01:05:04,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 154 transitions, 1556 flow [2025-03-15 01:05:04,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:04,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2025-03-15 01:05:04,169 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9342403628117913 [2025-03-15 01:05:04,170 INFO L298 CegarLoopForPetriNet]: 151 programPoint places, 4 predicate places. [2025-03-15 01:05:04,170 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 154 transitions, 1556 flow [2025-03-15 01:05:04,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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 01:05:04,170 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:04,170 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] [2025-03-15 01:05:04,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:05:04,170 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 01:05:04,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:04,171 INFO L85 PathProgramCache]: Analyzing trace with hash 727423882, now seen corresponding path program 1 times [2025-03-15 01:05:04,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:04,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866325669] [2025-03-15 01:05:04,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:04,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:04,213 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 01:05:04,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:04,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866325669] [2025-03-15 01:05:04,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866325669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:04,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:04,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:04,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857500778] [2025-03-15 01:05:04,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:04,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:04,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:04,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:04,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:04,215 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 147 [2025-03-15 01:05:04,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 154 transitions, 1556 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 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 01:05:04,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:04,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 147 [2025-03-15 01:05:04,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:04,274 INFO L124 PetriNetUnfolderBase]: 106/572 cut-off events. [2025-03-15 01:05:04,274 INFO L125 PetriNetUnfolderBase]: For 15802/17018 co-relation queries the response was YES. [2025-03-15 01:05:04,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2677 conditions, 572 events. 106/572 cut-off events. For 15802/17018 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3601 event pairs, 17 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 1685. Up to 158 conditions per place. [2025-03-15 01:05:04,277 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 37 selfloop transitions, 1 changer transitions 9/153 dead transitions. [2025-03-15 01:05:04,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 153 transitions, 1628 flow [2025-03-15 01:05:04,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:04,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2025-03-15 01:05:04,279 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9387755102040817 [2025-03-15 01:05:04,279 INFO L298 CegarLoopForPetriNet]: 151 programPoint places, 5 predicate places. [2025-03-15 01:05:04,279 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 153 transitions, 1628 flow [2025-03-15 01:05:04,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 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 01:05:04,279 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:04,279 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] [2025-03-15 01:05:04,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:05:04,280 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 01:05:04,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:04,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2049860263, now seen corresponding path program 1 times [2025-03-15 01:05:04,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:04,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597745057] [2025-03-15 01:05:04,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:04,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:04,334 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 01:05:04,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:04,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597745057] [2025-03-15 01:05:04,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597745057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:04,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:04,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:04,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702341002] [2025-03-15 01:05:04,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:04,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:04,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:04,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:04,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:04,335 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 147 [2025-03-15 01:05:04,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 153 transitions, 1628 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 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 01:05:04,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:04,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 147 [2025-03-15 01:05:04,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:04,381 INFO L124 PetriNetUnfolderBase]: 106/513 cut-off events. [2025-03-15 01:05:04,381 INFO L125 PetriNetUnfolderBase]: For 20054/21306 co-relation queries the response was YES. [2025-03-15 01:05:04,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2689 conditions, 513 events. 106/513 cut-off events. For 20054/21306 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3163 event pairs, 23 based on Foata normal form. 0/460 useless extension candidates. Maximal degree in co-relation 1769. Up to 154 conditions per place. [2025-03-15 01:05:04,383 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 0 selfloop transitions, 0 changer transitions 152/152 dead transitions. [2025-03-15 01:05:04,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 152 transitions, 1700 flow [2025-03-15 01:05:04,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:04,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:04,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2025-03-15 01:05:04,384 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9387755102040817 [2025-03-15 01:05:04,384 INFO L298 CegarLoopForPetriNet]: 151 programPoint places, 6 predicate places. [2025-03-15 01:05:04,384 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 152 transitions, 1700 flow [2025-03-15 01:05:04,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 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 01:05:04,389 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/security.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 01:05:04,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (32 of 33 remaining) [2025-03-15 01:05:04,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (31 of 33 remaining) [2025-03-15 01:05:04,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 33 remaining) [2025-03-15 01:05:04,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (29 of 33 remaining) [2025-03-15 01:05:04,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (28 of 33 remaining) [2025-03-15 01:05:04,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (27 of 33 remaining) [2025-03-15 01:05:04,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (26 of 33 remaining) [2025-03-15 01:05:04,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (25 of 33 remaining) [2025-03-15 01:05:04,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (24 of 33 remaining) [2025-03-15 01:05:04,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 33 remaining) [2025-03-15 01:05:04,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (22 of 33 remaining) [2025-03-15 01:05:04,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (21 of 33 remaining) [2025-03-15 01:05:04,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (20 of 33 remaining) [2025-03-15 01:05:04,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (19 of 33 remaining) [2025-03-15 01:05:04,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 33 remaining) [2025-03-15 01:05:04,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 33 remaining) [2025-03-15 01:05:04,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 33 remaining) [2025-03-15 01:05:04,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 33 remaining) [2025-03-15 01:05:04,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 33 remaining) [2025-03-15 01:05:04,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (13 of 33 remaining) [2025-03-15 01:05:04,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (12 of 33 remaining) [2025-03-15 01:05:04,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (11 of 33 remaining) [2025-03-15 01:05:04,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (10 of 33 remaining) [2025-03-15 01:05:04,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (9 of 33 remaining) [2025-03-15 01:05:04,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (8 of 33 remaining) [2025-03-15 01:05:04,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (7 of 33 remaining) [2025-03-15 01:05:04,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 33 remaining) [2025-03-15 01:05:04,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (5 of 33 remaining) [2025-03-15 01:05:04,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (4 of 33 remaining) [2025-03-15 01:05:04,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 33 remaining) [2025-03-15 01:05:04,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (2 of 33 remaining) [2025-03-15 01:05:04,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (1 of 33 remaining) [2025-03-15 01:05:04,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (0 of 33 remaining) [2025-03-15 01:05:04,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:05:04,410 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:05:04,414 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:05:04,414 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:05:04,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:05:04 BasicIcfg [2025-03-15 01:05:04,420 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:05:04,420 INFO L158 Benchmark]: Toolchain (without parser) took 2590.23ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 43.6MB in the beginning and 27.0MB in the end (delta: 16.6MB). Peak memory consumption was 53.3MB. Max. memory is 8.0GB. [2025-03-15 01:05:04,421 INFO L158 Benchmark]: CDTParser took 1.27ms. Allocated memory is still 71.3MB. Free memory is still 35.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:05:04,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.95ms. Allocated memory is still 71.3MB. Free memory was 43.4MB in the beginning and 32.1MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 01:05:04,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.76ms. Allocated memory is still 71.3MB. Free memory was 32.1MB in the beginning and 30.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:05:04,422 INFO L158 Benchmark]: Boogie Preprocessor took 23.15ms. Allocated memory is still 71.3MB. Free memory was 30.8MB in the beginning and 30.1MB in the end (delta: 747.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:05:04,422 INFO L158 Benchmark]: RCFGBuilder took 297.63ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 43.0MB in the end (delta: -13.0MB). Peak memory consumption was 19.5MB. Max. memory is 8.0GB. [2025-03-15 01:05:04,423 INFO L158 Benchmark]: TraceAbstraction took 2069.84ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 41.7MB in the beginning and 27.0MB in the end (delta: 14.7MB). Peak memory consumption was 50.6MB. Max. memory is 8.0GB. [2025-03-15 01:05:04,423 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.27ms. Allocated memory is still 71.3MB. Free memory is still 35.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 172.95ms. Allocated memory is still 71.3MB. Free memory was 43.4MB in the beginning and 32.1MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.76ms. Allocated memory is still 71.3MB. Free memory was 32.1MB in the beginning and 30.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.15ms. Allocated memory is still 71.3MB. Free memory was 30.8MB in the beginning and 30.1MB in the end (delta: 747.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 297.63ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 43.0MB in the end (delta: -13.0MB). Peak memory consumption was 19.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2069.84ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 41.7MB in the beginning and 27.0MB in the end (delta: 14.7MB). Peak memory consumption was 50.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 231 locations, 33 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 230 IncrementalHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 96 mSDtfsCounter, 230 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1700occurred in iteration=16, InterpolantAutomatonStates: 48, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 801 NumberOfCodeBlocks, 801 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 785 ConstructedInterpolants, 0 QuantifiedInterpolants, 817 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:05:04,437 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 Received shutdown request...