./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:25:09,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:25:09,871 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:25:09,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:25:09,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:25:09,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:25:09,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:25:09,895 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:25:09,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:25:09,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:25:09,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:25:09,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:25:09,897 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:25:09,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:25:09,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:25:09,897 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:25:09,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:25:09,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:25:09,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:25:09,898 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:25:09,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:25:09,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:25:09,898 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:25:09,898 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:25:09,898 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:25:09,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:25:09,898 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:25:09,898 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:25:09,898 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:25:09,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:25:09,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:25:09,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:25:09,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:25:09,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:25:09,898 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:25:09,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:25:09,899 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:25:09,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:25:09,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:25:09,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:25:09,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:25:09,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:25:09,899 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 [2025-03-13 22:25:10,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:25:10,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:25:10,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:25:10,117 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:25:10,118 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:25:10,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-03-13 22:25:11,231 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138fe3709/9fd560553f134bba891ee9416ce99f11/FLAG51a2de4a8 [2025-03-13 22:25:11,468 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:25:11,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-03-13 22:25:11,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138fe3709/9fd560553f134bba891ee9416ce99f11/FLAG51a2de4a8 [2025-03-13 22:25:11,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138fe3709/9fd560553f134bba891ee9416ce99f11 [2025-03-13 22:25:11,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:25:11,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:25:11,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:25:11,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:25:11,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:25:11,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:25:11" (1/1) ... [2025-03-13 22:25:11,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22da2d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:11, skipping insertion in model container [2025-03-13 22:25:11,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:25:11" (1/1) ... [2025-03-13 22:25:11,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:25:12,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:25:12,015 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:25:12,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:25:12,069 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:25:12,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:12 WrapperNode [2025-03-13 22:25:12,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:25:12,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:25:12,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:25:12,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:25:12,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:12" (1/1) ... [2025-03-13 22:25:12,089 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:12" (1/1) ... [2025-03-13 22:25:12,119 INFO L138 Inliner]: procedures = 24, calls = 54, calls flagged for inlining = 21, calls inlined = 25, statements flattened = 734 [2025-03-13 22:25:12,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:25:12,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:25:12,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:25:12,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:25:12,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:12" (1/1) ... [2025-03-13 22:25:12,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:12" (1/1) ... [2025-03-13 22:25:12,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:12" (1/1) ... [2025-03-13 22:25:12,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:12" (1/1) ... [2025-03-13 22:25:12,161 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:12" (1/1) ... [2025-03-13 22:25:12,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:12" (1/1) ... [2025-03-13 22:25:12,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:12" (1/1) ... [2025-03-13 22:25:12,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:12" (1/1) ... [2025-03-13 22:25:12,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:25:12,182 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:25:12,182 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:25:12,182 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:25:12,183 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:12" (1/1) ... [2025-03-13 22:25:12,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:25:12,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:25:12,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:25:12,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:25:12,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:25:12,237 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:25:12,237 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:25:12,237 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:25:12,237 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:25:12,237 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 22:25:12,237 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 22:25:12,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:25:12,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:25:12,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 22:25:12,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 22:25:12,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:25:12,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:25:12,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:25:12,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:25:12,239 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:25:12,357 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:25:12,359 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:25:13,170 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:25:13,171 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:25:13,171 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:25:13,788 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:25:13,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:13 BoogieIcfgContainer [2025-03-13 22:25:13,791 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:25:13,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:25:13,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:25:13,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:25:13,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:25:11" (1/3) ... [2025-03-13 22:25:13,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61cc0760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:25:13, skipping insertion in model container [2025-03-13 22:25:13,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:12" (2/3) ... [2025-03-13 22:25:13,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61cc0760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:25:13, skipping insertion in model container [2025-03-13 22:25:13,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:13" (3/3) ... [2025-03-13 22:25:13,834 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2025-03-13 22:25:13,848 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:25:13,851 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-commit-1.wvr-bad.c that has 4 procedures, 489 locations, 1 initial locations, 6 loop locations, and 125 error locations. [2025-03-13 22:25:13,852 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:25:13,969 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 22:25:13,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 498 places, 512 transitions, 1045 flow [2025-03-13 22:25:14,157 INFO L124 PetriNetUnfolderBase]: 24/509 cut-off events. [2025-03-13 22:25:14,159 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:25:14,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 509 events. 24/509 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1046 event pairs, 0 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 444. Up to 6 conditions per place. [2025-03-13 22:25:14,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 498 places, 512 transitions, 1045 flow [2025-03-13 22:25:14,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 479 places, 492 transitions, 1002 flow [2025-03-13 22:25:14,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:25:14,188 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5b5e32d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:25:14,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 228 error locations. [2025-03-13 22:25:14,195 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:25:14,199 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-13 22:25:14,199 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:25:14,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:14,200 INFO L206 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-13 22:25:14,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:14,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:14,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1176687300, now seen corresponding path program 1 times [2025-03-13 22:25:14,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:14,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681619342] [2025-03-13 22:25:14,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:14,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:14,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 22:25:14,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 22:25:14,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:14,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:14,333 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-13 22:25:14,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:14,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681619342] [2025-03-13 22:25:14,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681619342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:14,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:14,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:14,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241104660] [2025-03-13 22:25:14,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:14,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:14,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:14,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:14,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:14,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 512 [2025-03-13 22:25:14,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 492 transitions, 1002 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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-13 22:25:14,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:14,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 512 [2025-03-13 22:25:14,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:14,489 INFO L124 PetriNetUnfolderBase]: 30/406 cut-off events. [2025-03-13 22:25:14,489 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-13 22:25:14,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 406 events. 30/406 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 403 event pairs, 0 based on Foata normal form. 15/361 useless extension candidates. Maximal degree in co-relation 387. Up to 35 conditions per place. [2025-03-13 22:25:14,493 INFO L140 encePairwiseOnDemand]: 408/512 looper letters, 18 selfloop transitions, 2 changer transitions 6/390 dead transitions. [2025-03-13 22:25:14,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 390 transitions, 838 flow [2025-03-13 22:25:14,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:14,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2025-03-13 22:25:14,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8352864583333334 [2025-03-13 22:25:14,511 INFO L175 Difference]: Start difference. First operand has 479 places, 492 transitions, 1002 flow. Second operand 3 states and 1283 transitions. [2025-03-13 22:25:14,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 390 transitions, 838 flow [2025-03-13 22:25:14,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 390 transitions, 826 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 22:25:14,526 INFO L231 Difference]: Finished difference. Result has 382 places, 384 transitions, 778 flow [2025-03-13 22:25:14,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=778, PETRI_PLACES=382, PETRI_TRANSITIONS=384} [2025-03-13 22:25:14,532 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -97 predicate places. [2025-03-13 22:25:14,532 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 384 transitions, 778 flow [2025-03-13 22:25:14,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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-13 22:25:14,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:14,534 INFO L206 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-13 22:25:14,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:25:14,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:14,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:14,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1122075374, now seen corresponding path program 1 times [2025-03-13 22:25:14,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:14,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260353218] [2025-03-13 22:25:14,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:14,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:14,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-13 22:25:14,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 22:25:14,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:14,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:14,602 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-13 22:25:14,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:14,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260353218] [2025-03-13 22:25:14,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260353218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:14,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:14,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:14,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708470449] [2025-03-13 22:25:14,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:14,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:14,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:14,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:14,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:14,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 512 [2025-03-13 22:25:14,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 384 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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-13 22:25:14,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:14,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 512 [2025-03-13 22:25:14,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:14,702 INFO L124 PetriNetUnfolderBase]: 30/399 cut-off events. [2025-03-13 22:25:14,702 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:25:14,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 399 events. 30/399 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 393 event pairs, 0 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 403. Up to 35 conditions per place. [2025-03-13 22:25:14,705 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 18 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2025-03-13 22:25:14,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 383 transitions, 816 flow [2025-03-13 22:25:14,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:14,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-03-13 22:25:14,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.76953125 [2025-03-13 22:25:14,708 INFO L175 Difference]: Start difference. First operand has 382 places, 384 transitions, 778 flow. Second operand 3 states and 1182 transitions. [2025-03-13 22:25:14,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 383 transitions, 816 flow [2025-03-13 22:25:14,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 383 transitions, 812 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:14,714 INFO L231 Difference]: Finished difference. Result has 375 places, 383 transitions, 776 flow [2025-03-13 22:25:14,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=375, PETRI_TRANSITIONS=383} [2025-03-13 22:25:14,716 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -104 predicate places. [2025-03-13 22:25:14,716 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 383 transitions, 776 flow [2025-03-13 22:25:14,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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-13 22:25:14,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:14,717 INFO L206 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-13 22:25:14,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:25:14,717 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:14,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:14,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1957800900, now seen corresponding path program 1 times [2025-03-13 22:25:14,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:14,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748070484] [2025-03-13 22:25:14,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:14,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:14,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-13 22:25:14,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-13 22:25:14,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:14,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:14,805 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-13 22:25:14,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:14,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748070484] [2025-03-13 22:25:14,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748070484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:14,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:14,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:14,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223691362] [2025-03-13 22:25:14,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:14,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:14,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:14,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:14,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:14,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 512 [2025-03-13 22:25:14,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 383 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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-13 22:25:14,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:14,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 512 [2025-03-13 22:25:14,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:14,915 INFO L124 PetriNetUnfolderBase]: 30/398 cut-off events. [2025-03-13 22:25:14,916 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:25:14,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 398 events. 30/398 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 387 event pairs, 0 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 394. Up to 35 conditions per place. [2025-03-13 22:25:14,919 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 18 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2025-03-13 22:25:14,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 382 transitions, 814 flow [2025-03-13 22:25:14,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:14,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-03-13 22:25:14,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.76953125 [2025-03-13 22:25:14,923 INFO L175 Difference]: Start difference. First operand has 375 places, 383 transitions, 776 flow. Second operand 3 states and 1182 transitions. [2025-03-13 22:25:14,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 382 transitions, 814 flow [2025-03-13 22:25:14,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 382 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:14,931 INFO L231 Difference]: Finished difference. Result has 374 places, 382 transitions, 774 flow [2025-03-13 22:25:14,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=374, PETRI_TRANSITIONS=382} [2025-03-13 22:25:14,932 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -105 predicate places. [2025-03-13 22:25:14,932 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 382 transitions, 774 flow [2025-03-13 22:25:14,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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-13 22:25:14,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:14,934 INFO L206 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] [2025-03-13 22:25:14,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:25:14,934 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:14,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:14,935 INFO L85 PathProgramCache]: Analyzing trace with hash -611565455, now seen corresponding path program 1 times [2025-03-13 22:25:14,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:14,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733663404] [2025-03-13 22:25:14,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:14,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:14,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-13 22:25:14,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-13 22:25:14,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:14,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:14,975 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-13 22:25:14,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:14,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733663404] [2025-03-13 22:25:14,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733663404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:14,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:14,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:14,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568286473] [2025-03-13 22:25:14,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:14,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:14,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:14,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:14,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:14,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 512 [2025-03-13 22:25:14,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 382 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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-13 22:25:14,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:14,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 512 [2025-03-13 22:25:14,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:15,127 INFO L124 PetriNetUnfolderBase]: 56/512 cut-off events. [2025-03-13 22:25:15,127 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:25:15,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 512 events. 56/512 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 917 event pairs, 0 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 528. Up to 37 conditions per place. [2025-03-13 22:25:15,130 INFO L140 encePairwiseOnDemand]: 508/512 looper letters, 27 selfloop transitions, 3 changer transitions 0/394 dead transitions. [2025-03-13 22:25:15,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 394 transitions, 863 flow [2025-03-13 22:25:15,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:15,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2025-03-13 22:25:15,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7838541666666666 [2025-03-13 22:25:15,133 INFO L175 Difference]: Start difference. First operand has 374 places, 382 transitions, 774 flow. Second operand 3 states and 1204 transitions. [2025-03-13 22:25:15,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 394 transitions, 863 flow [2025-03-13 22:25:15,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 394 transitions, 859 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:15,138 INFO L231 Difference]: Finished difference. Result has 374 places, 383 transitions, 785 flow [2025-03-13 22:25:15,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=785, PETRI_PLACES=374, PETRI_TRANSITIONS=383} [2025-03-13 22:25:15,139 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -105 predicate places. [2025-03-13 22:25:15,139 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 383 transitions, 785 flow [2025-03-13 22:25:15,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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-13 22:25:15,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:15,140 INFO L206 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] [2025-03-13 22:25:15,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:25:15,140 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:15,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:15,140 INFO L85 PathProgramCache]: Analyzing trace with hash -981531387, now seen corresponding path program 1 times [2025-03-13 22:25:15,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:15,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348537758] [2025-03-13 22:25:15,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:15,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:15,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-13 22:25:15,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-13 22:25:15,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:15,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:15,203 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-13 22:25:15,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:15,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348537758] [2025-03-13 22:25:15,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348537758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:15,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:15,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:15,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361827112] [2025-03-13 22:25:15,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:15,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:15,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:15,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:15,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:15,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 512 [2025-03-13 22:25:15,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 383 transitions, 785 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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-13 22:25:15,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:15,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 512 [2025-03-13 22:25:15,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:15,328 INFO L124 PetriNetUnfolderBase]: 56/498 cut-off events. [2025-03-13 22:25:15,329 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-13 22:25:15,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 498 events. 56/498 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 881 event pairs, 2 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 370. Up to 63 conditions per place. [2025-03-13 22:25:15,333 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 19 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2025-03-13 22:25:15,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 382 transitions, 825 flow [2025-03-13 22:25:15,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:15,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2025-03-13 22:25:15,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2025-03-13 22:25:15,338 INFO L175 Difference]: Start difference. First operand has 374 places, 383 transitions, 785 flow. Second operand 3 states and 1184 transitions. [2025-03-13 22:25:15,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 382 transitions, 825 flow [2025-03-13 22:25:15,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 382 transitions, 822 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:25:15,345 INFO L231 Difference]: Finished difference. Result has 374 places, 382 transitions, 784 flow [2025-03-13 22:25:15,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=374, PETRI_TRANSITIONS=382} [2025-03-13 22:25:15,347 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -105 predicate places. [2025-03-13 22:25:15,347 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 382 transitions, 784 flow [2025-03-13 22:25:15,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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-13 22:25:15,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:15,349 INFO L206 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] [2025-03-13 22:25:15,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:25:15,351 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:15,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:15,352 INFO L85 PathProgramCache]: Analyzing trace with hash -661870297, now seen corresponding path program 1 times [2025-03-13 22:25:15,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:15,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093346038] [2025-03-13 22:25:15,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:15,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:15,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-13 22:25:15,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-13 22:25:15,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:15,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:15,402 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-13 22:25:15,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:15,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093346038] [2025-03-13 22:25:15,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093346038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:15,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:15,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:15,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440453791] [2025-03-13 22:25:15,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:15,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:15,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:15,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:15,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:15,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 512 [2025-03-13 22:25:15,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 382 transitions, 784 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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-13 22:25:15,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:15,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 512 [2025-03-13 22:25:15,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:15,500 INFO L124 PetriNetUnfolderBase]: 56/497 cut-off events. [2025-03-13 22:25:15,501 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-13 22:25:15,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 497 events. 56/497 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 882 event pairs, 2 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 518. Up to 61 conditions per place. [2025-03-13 22:25:15,505 INFO L140 encePairwiseOnDemand]: 510/512 looper letters, 18 selfloop transitions, 1 changer transitions 0/381 dead transitions. [2025-03-13 22:25:15,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 381 transitions, 820 flow [2025-03-13 22:25:15,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:15,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1191 transitions. [2025-03-13 22:25:15,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.775390625 [2025-03-13 22:25:15,508 INFO L175 Difference]: Start difference. First operand has 374 places, 382 transitions, 784 flow. Second operand 3 states and 1191 transitions. [2025-03-13 22:25:15,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 381 transitions, 820 flow [2025-03-13 22:25:15,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 381 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:15,513 INFO L231 Difference]: Finished difference. Result has 373 places, 381 transitions, 780 flow [2025-03-13 22:25:15,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=373, PETRI_TRANSITIONS=381} [2025-03-13 22:25:15,514 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -106 predicate places. [2025-03-13 22:25:15,514 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 381 transitions, 780 flow [2025-03-13 22:25:15,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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-13 22:25:15,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:15,515 INFO L206 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] [2025-03-13 22:25:15,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:25:15,516 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:15,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:15,516 INFO L85 PathProgramCache]: Analyzing trace with hash 679295881, now seen corresponding path program 1 times [2025-03-13 22:25:15,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:15,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594460116] [2025-03-13 22:25:15,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:15,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:15,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-13 22:25:15,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-13 22:25:15,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:15,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:16,022 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-13 22:25:16,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:16,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594460116] [2025-03-13 22:25:16,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594460116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:16,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:16,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:25:16,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956516288] [2025-03-13 22:25:16,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:16,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:25:16,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:16,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:25:16,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:25:16,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 512 [2025-03-13 22:25:16,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 381 transitions, 780 flow. Second operand has 6 states, 6 states have (on average 354.5) internal successors, (2127), 6 states have internal predecessors, (2127), 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-13 22:25:16,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:16,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 512 [2025-03-13 22:25:16,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:16,312 INFO L124 PetriNetUnfolderBase]: 56/494 cut-off events. [2025-03-13 22:25:16,313 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-13 22:25:16,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 494 events. 56/494 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 868 event pairs, 2 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 551. Up to 84 conditions per place. [2025-03-13 22:25:16,316 INFO L140 encePairwiseOnDemand]: 494/512 looper letters, 40 selfloop transitions, 15 changer transitions 0/378 dead transitions. [2025-03-13 22:25:16,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 378 transitions, 884 flow [2025-03-13 22:25:16,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:25:16,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:25:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2174 transitions. [2025-03-13 22:25:16,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7076822916666666 [2025-03-13 22:25:16,321 INFO L175 Difference]: Start difference. First operand has 373 places, 381 transitions, 780 flow. Second operand 6 states and 2174 transitions. [2025-03-13 22:25:16,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 378 transitions, 884 flow [2025-03-13 22:25:16,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 378 transitions, 883 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:25:16,326 INFO L231 Difference]: Finished difference. Result has 374 places, 378 transitions, 803 flow [2025-03-13 22:25:16,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=803, PETRI_PLACES=374, PETRI_TRANSITIONS=378} [2025-03-13 22:25:16,328 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -105 predicate places. [2025-03-13 22:25:16,328 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 378 transitions, 803 flow [2025-03-13 22:25:16,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 354.5) internal successors, (2127), 6 states have internal predecessors, (2127), 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-13 22:25:16,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:16,330 INFO L206 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] [2025-03-13 22:25:16,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:25:16,330 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:16,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:16,331 INFO L85 PathProgramCache]: Analyzing trace with hash 817138704, now seen corresponding path program 1 times [2025-03-13 22:25:16,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:16,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579983552] [2025-03-13 22:25:16,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:16,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:16,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-13 22:25:16,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-13 22:25:16,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:16,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:16,392 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-13 22:25:16,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:16,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579983552] [2025-03-13 22:25:16,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579983552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:16,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:16,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:16,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255226355] [2025-03-13 22:25:16,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:16,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:16,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:16,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:16,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:16,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 512 [2025-03-13 22:25:16,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 378 transitions, 803 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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-13 22:25:16,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:16,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 512 [2025-03-13 22:25:16,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:16,486 INFO L124 PetriNetUnfolderBase]: 56/493 cut-off events. [2025-03-13 22:25:16,486 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-13 22:25:16,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 493 events. 56/493 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 862 event pairs, 2 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 546. Up to 63 conditions per place. [2025-03-13 22:25:16,489 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 19 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2025-03-13 22:25:16,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 377 transitions, 843 flow [2025-03-13 22:25:16,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:16,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:16,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2025-03-13 22:25:16,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2025-03-13 22:25:16,493 INFO L175 Difference]: Start difference. First operand has 374 places, 378 transitions, 803 flow. Second operand 3 states and 1184 transitions. [2025-03-13 22:25:16,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 377 transitions, 843 flow [2025-03-13 22:25:16,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 377 transitions, 813 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:25:16,498 INFO L231 Difference]: Finished difference. Result has 370 places, 377 transitions, 775 flow [2025-03-13 22:25:16,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=370, PETRI_TRANSITIONS=377} [2025-03-13 22:25:16,499 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -109 predicate places. [2025-03-13 22:25:16,500 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 377 transitions, 775 flow [2025-03-13 22:25:16,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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-13 22:25:16,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:16,501 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:16,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:25:16,501 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:16,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:16,502 INFO L85 PathProgramCache]: Analyzing trace with hash 777082776, now seen corresponding path program 1 times [2025-03-13 22:25:16,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:16,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960479740] [2025-03-13 22:25:16,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:16,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:16,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-13 22:25:16,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-13 22:25:16,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:16,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:16,544 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-13 22:25:16,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:16,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960479740] [2025-03-13 22:25:16,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960479740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:16,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:16,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:16,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337876609] [2025-03-13 22:25:16,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:16,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:16,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:16,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:16,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:16,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 512 [2025-03-13 22:25:16,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 377 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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-13 22:25:16,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:16,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 512 [2025-03-13 22:25:16,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:16,636 INFO L124 PetriNetUnfolderBase]: 56/492 cut-off events. [2025-03-13 22:25:16,637 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-13 22:25:16,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 492 events. 56/492 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 862 event pairs, 2 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 517. Up to 64 conditions per place. [2025-03-13 22:25:16,642 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 20 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2025-03-13 22:25:16,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 376 transitions, 817 flow [2025-03-13 22:25:16,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:16,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:16,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-03-13 22:25:16,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.76953125 [2025-03-13 22:25:16,645 INFO L175 Difference]: Start difference. First operand has 370 places, 377 transitions, 775 flow. Second operand 3 states and 1182 transitions. [2025-03-13 22:25:16,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 376 transitions, 817 flow [2025-03-13 22:25:16,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 376 transitions, 813 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:16,650 INFO L231 Difference]: Finished difference. Result has 369 places, 376 transitions, 773 flow [2025-03-13 22:25:16,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=773, PETRI_PLACES=369, PETRI_TRANSITIONS=376} [2025-03-13 22:25:16,651 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -110 predicate places. [2025-03-13 22:25:16,651 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 376 transitions, 773 flow [2025-03-13 22:25:16,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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-13 22:25:16,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:16,653 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:16,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:25:16,653 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:16,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:16,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1953462919, now seen corresponding path program 1 times [2025-03-13 22:25:16,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:16,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496347568] [2025-03-13 22:25:16,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:16,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:16,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-13 22:25:16,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-13 22:25:16,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:16,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:16,696 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-13 22:25:16,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:16,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496347568] [2025-03-13 22:25:16,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496347568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:16,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:16,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:16,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403157629] [2025-03-13 22:25:16,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:16,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:16,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:16,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:16,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:16,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 512 [2025-03-13 22:25:16,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 376 transitions, 773 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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-13 22:25:16,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:16,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 512 [2025-03-13 22:25:16,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:16,809 INFO L124 PetriNetUnfolderBase]: 88/637 cut-off events. [2025-03-13 22:25:16,809 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-13 22:25:16,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 637 events. 88/637 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1444 event pairs, 2 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 698. Up to 55 conditions per place. [2025-03-13 22:25:16,815 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 30 selfloop transitions, 2 changer transitions 0/388 dead transitions. [2025-03-13 22:25:16,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 388 transitions, 872 flow [2025-03-13 22:25:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:16,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1202 transitions. [2025-03-13 22:25:16,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7825520833333334 [2025-03-13 22:25:16,818 INFO L175 Difference]: Start difference. First operand has 369 places, 376 transitions, 773 flow. Second operand 3 states and 1202 transitions. [2025-03-13 22:25:16,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 388 transitions, 872 flow [2025-03-13 22:25:16,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 388 transitions, 868 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:16,823 INFO L231 Difference]: Finished difference. Result has 369 places, 376 transitions, 777 flow [2025-03-13 22:25:16,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=777, PETRI_PLACES=369, PETRI_TRANSITIONS=376} [2025-03-13 22:25:16,824 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -110 predicate places. [2025-03-13 22:25:16,825 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 376 transitions, 777 flow [2025-03-13 22:25:16,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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-13 22:25:16,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:16,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:16,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:25:16,826 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:16,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:16,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1744820149, now seen corresponding path program 1 times [2025-03-13 22:25:16,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:16,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185691805] [2025-03-13 22:25:16,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:16,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:16,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-13 22:25:16,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-13 22:25:16,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:16,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:16,882 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-13 22:25:16,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:16,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185691805] [2025-03-13 22:25:16,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185691805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:16,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:16,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:16,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629890809] [2025-03-13 22:25:16,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:16,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:16,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:16,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:16,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:16,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 512 [2025-03-13 22:25:16,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 376 transitions, 777 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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-13 22:25:16,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:16,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 512 [2025-03-13 22:25:16,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:16,997 INFO L124 PetriNetUnfolderBase]: 84/564 cut-off events. [2025-03-13 22:25:16,997 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-13 22:25:17,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 564 events. 84/564 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1146 event pairs, 7 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 643. Up to 97 conditions per place. [2025-03-13 22:25:17,003 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 20 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2025-03-13 22:25:17,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 375 transitions, 819 flow [2025-03-13 22:25:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2025-03-13 22:25:17,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2025-03-13 22:25:17,006 INFO L175 Difference]: Start difference. First operand has 369 places, 376 transitions, 777 flow. Second operand 3 states and 1184 transitions. [2025-03-13 22:25:17,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 375 transitions, 819 flow [2025-03-13 22:25:17,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 375 transitions, 817 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:25:17,012 INFO L231 Difference]: Finished difference. Result has 369 places, 375 transitions, 777 flow [2025-03-13 22:25:17,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=777, PETRI_PLACES=369, PETRI_TRANSITIONS=375} [2025-03-13 22:25:17,013 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -110 predicate places. [2025-03-13 22:25:17,013 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 375 transitions, 777 flow [2025-03-13 22:25:17,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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-13 22:25:17,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:17,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:17,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:25:17,015 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:17,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:17,015 INFO L85 PathProgramCache]: Analyzing trace with hash 723524101, now seen corresponding path program 1 times [2025-03-13 22:25:17,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:17,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594716104] [2025-03-13 22:25:17,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:17,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:17,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-13 22:25:17,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-13 22:25:17,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:17,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:17,055 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-13 22:25:17,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:17,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594716104] [2025-03-13 22:25:17,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594716104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:17,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:17,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:17,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938733240] [2025-03-13 22:25:17,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:17,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:17,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:17,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:17,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:17,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 512 [2025-03-13 22:25:17,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 375 transitions, 777 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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-13 22:25:17,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:17,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 512 [2025-03-13 22:25:17,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:17,165 INFO L124 PetriNetUnfolderBase]: 84/563 cut-off events. [2025-03-13 22:25:17,166 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-13 22:25:17,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 563 events. 84/563 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1143 event pairs, 7 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 639. Up to 98 conditions per place. [2025-03-13 22:25:17,170 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 21 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2025-03-13 22:25:17,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 374 transitions, 821 flow [2025-03-13 22:25:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:17,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:17,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-03-13 22:25:17,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.76953125 [2025-03-13 22:25:17,173 INFO L175 Difference]: Start difference. First operand has 369 places, 375 transitions, 777 flow. Second operand 3 states and 1182 transitions. [2025-03-13 22:25:17,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 374 transitions, 821 flow [2025-03-13 22:25:17,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 374 transitions, 817 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:17,179 INFO L231 Difference]: Finished difference. Result has 368 places, 374 transitions, 775 flow [2025-03-13 22:25:17,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=368, PETRI_TRANSITIONS=374} [2025-03-13 22:25:17,181 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -111 predicate places. [2025-03-13 22:25:17,181 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 374 transitions, 775 flow [2025-03-13 22:25:17,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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-13 22:25:17,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:17,182 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:17,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:25:17,183 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:17,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:17,183 INFO L85 PathProgramCache]: Analyzing trace with hash 237291363, now seen corresponding path program 1 times [2025-03-13 22:25:17,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:17,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998475833] [2025-03-13 22:25:17,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:17,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:17,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-13 22:25:17,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-13 22:25:17,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:17,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:17,221 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-13 22:25:17,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:17,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998475833] [2025-03-13 22:25:17,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998475833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:17,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:17,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:17,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267047492] [2025-03-13 22:25:17,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:17,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:17,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:17,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:17,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:17,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 512 [2025-03-13 22:25:17,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 374 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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-13 22:25:17,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:17,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 512 [2025-03-13 22:25:17,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:17,311 INFO L124 PetriNetUnfolderBase]: 84/562 cut-off events. [2025-03-13 22:25:17,311 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-13 22:25:17,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 562 events. 84/562 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1141 event pairs, 7 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 636. Up to 95 conditions per place. [2025-03-13 22:25:17,315 INFO L140 encePairwiseOnDemand]: 510/512 looper letters, 19 selfloop transitions, 1 changer transitions 0/373 dead transitions. [2025-03-13 22:25:17,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 373 transitions, 813 flow [2025-03-13 22:25:17,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1191 transitions. [2025-03-13 22:25:17,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.775390625 [2025-03-13 22:25:17,319 INFO L175 Difference]: Start difference. First operand has 368 places, 374 transitions, 775 flow. Second operand 3 states and 1191 transitions. [2025-03-13 22:25:17,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 373 transitions, 813 flow [2025-03-13 22:25:17,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 373 transitions, 809 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:17,325 INFO L231 Difference]: Finished difference. Result has 367 places, 373 transitions, 771 flow [2025-03-13 22:25:17,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=367, PETRI_TRANSITIONS=373} [2025-03-13 22:25:17,327 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -112 predicate places. [2025-03-13 22:25:17,327 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 373 transitions, 771 flow [2025-03-13 22:25:17,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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-13 22:25:17,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:17,328 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:17,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:25:17,328 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:17,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:17,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1371371261, now seen corresponding path program 1 times [2025-03-13 22:25:17,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:17,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027906421] [2025-03-13 22:25:17,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:17,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:17,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-13 22:25:17,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-13 22:25:17,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:17,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:17,371 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-13 22:25:17,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:17,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027906421] [2025-03-13 22:25:17,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027906421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:17,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:17,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:17,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218680087] [2025-03-13 22:25:17,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:17,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:17,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:17,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:17,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:17,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 512 [2025-03-13 22:25:17,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 373 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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-13 22:25:17,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:17,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 512 [2025-03-13 22:25:17,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:17,485 INFO L124 PetriNetUnfolderBase]: 84/561 cut-off events. [2025-03-13 22:25:17,485 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-13 22:25:17,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 561 events. 84/561 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1131 event pairs, 7 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 635. Up to 97 conditions per place. [2025-03-13 22:25:17,488 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 20 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2025-03-13 22:25:17,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 372 transitions, 813 flow [2025-03-13 22:25:17,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:17,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2025-03-13 22:25:17,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2025-03-13 22:25:17,491 INFO L175 Difference]: Start difference. First operand has 367 places, 373 transitions, 771 flow. Second operand 3 states and 1184 transitions. [2025-03-13 22:25:17,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 372 transitions, 813 flow [2025-03-13 22:25:17,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 372 transitions, 812 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:25:17,495 INFO L231 Difference]: Finished difference. Result has 367 places, 372 transitions, 772 flow [2025-03-13 22:25:17,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=367, PETRI_TRANSITIONS=372} [2025-03-13 22:25:17,497 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -112 predicate places. [2025-03-13 22:25:17,497 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 372 transitions, 772 flow [2025-03-13 22:25:17,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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-13 22:25:17,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:17,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:17,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:25:17,498 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:17,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:17,499 INFO L85 PathProgramCache]: Analyzing trace with hash -977726077, now seen corresponding path program 1 times [2025-03-13 22:25:17,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:17,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793590464] [2025-03-13 22:25:17,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:17,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:17,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-13 22:25:17,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-13 22:25:17,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:17,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:17,536 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-13 22:25:17,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:17,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793590464] [2025-03-13 22:25:17,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793590464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:17,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:17,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:17,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245254162] [2025-03-13 22:25:17,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:17,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:17,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:17,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:17,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:17,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 512 [2025-03-13 22:25:17,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 372 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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-13 22:25:17,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:17,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 512 [2025-03-13 22:25:17,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:17,620 INFO L124 PetriNetUnfolderBase]: 84/560 cut-off events. [2025-03-13 22:25:17,620 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-13 22:25:17,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 560 events. 84/560 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1127 event pairs, 7 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 637. Up to 98 conditions per place. [2025-03-13 22:25:17,624 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 21 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2025-03-13 22:25:17,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 371 transitions, 816 flow [2025-03-13 22:25:17,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:17,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:17,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-03-13 22:25:17,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.76953125 [2025-03-13 22:25:17,626 INFO L175 Difference]: Start difference. First operand has 367 places, 372 transitions, 772 flow. Second operand 3 states and 1182 transitions. [2025-03-13 22:25:17,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 371 transitions, 816 flow [2025-03-13 22:25:17,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 371 transitions, 812 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:17,630 INFO L231 Difference]: Finished difference. Result has 366 places, 371 transitions, 770 flow [2025-03-13 22:25:17,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=366, PETRI_TRANSITIONS=371} [2025-03-13 22:25:17,632 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -113 predicate places. [2025-03-13 22:25:17,632 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 371 transitions, 770 flow [2025-03-13 22:25:17,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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-13 22:25:17,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:17,632 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:17,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:25:17,633 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:17,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:17,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1956632782, now seen corresponding path program 1 times [2025-03-13 22:25:17,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:17,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100441662] [2025-03-13 22:25:17,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:17,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:17,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-13 22:25:17,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-13 22:25:17,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:17,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:17,671 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-13 22:25:17,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:17,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100441662] [2025-03-13 22:25:17,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100441662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:17,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:17,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:17,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533106807] [2025-03-13 22:25:17,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:17,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:17,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:17,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:17,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:17,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 512 [2025-03-13 22:25:17,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 371 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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-13 22:25:17,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:17,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 512 [2025-03-13 22:25:17,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:17,826 INFO L124 PetriNetUnfolderBase]: 158/829 cut-off events. [2025-03-13 22:25:17,826 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-13 22:25:17,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1077 conditions, 829 events. 158/829 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2690 event pairs, 7 based on Foata normal form. 0/702 useless extension candidates. Maximal degree in co-relation 1012. Up to 94 conditions per place. [2025-03-13 22:25:17,832 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 33 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2025-03-13 22:25:17,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 385 transitions, 884 flow [2025-03-13 22:25:17,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:17,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1203 transitions. [2025-03-13 22:25:17,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.783203125 [2025-03-13 22:25:17,835 INFO L175 Difference]: Start difference. First operand has 366 places, 371 transitions, 770 flow. Second operand 3 states and 1203 transitions. [2025-03-13 22:25:17,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 385 transitions, 884 flow [2025-03-13 22:25:17,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 385 transitions, 880 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:17,840 INFO L231 Difference]: Finished difference. Result has 366 places, 371 transitions, 774 flow [2025-03-13 22:25:17,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=366, PETRI_TRANSITIONS=371} [2025-03-13 22:25:17,840 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -113 predicate places. [2025-03-13 22:25:17,841 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 371 transitions, 774 flow [2025-03-13 22:25:17,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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-13 22:25:17,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:17,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:17,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:25:17,842 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:17,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:17,843 INFO L85 PathProgramCache]: Analyzing trace with hash 6968966, now seen corresponding path program 1 times [2025-03-13 22:25:17,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:17,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722585828] [2025-03-13 22:25:17,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:17,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:17,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-13 22:25:17,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-13 22:25:17,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:17,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:17,890 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-13 22:25:17,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:17,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722585828] [2025-03-13 22:25:17,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722585828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:17,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:17,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:17,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069431488] [2025-03-13 22:25:17,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:17,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:17,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:17,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:17,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:17,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 512 [2025-03-13 22:25:17,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 371 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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-13 22:25:17,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:17,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 512 [2025-03-13 22:25:17,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:18,005 INFO L124 PetriNetUnfolderBase]: 154/760 cut-off events. [2025-03-13 22:25:18,005 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-03-13 22:25:18,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 760 events. 154/760 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2276 event pairs, 22 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 973. Up to 179 conditions per place. [2025-03-13 22:25:18,014 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 21 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-03-13 22:25:18,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 370 transitions, 818 flow [2025-03-13 22:25:18,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:18,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:18,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2025-03-13 22:25:18,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2025-03-13 22:25:18,016 INFO L175 Difference]: Start difference. First operand has 366 places, 371 transitions, 774 flow. Second operand 3 states and 1184 transitions. [2025-03-13 22:25:18,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 370 transitions, 818 flow [2025-03-13 22:25:18,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 370 transitions, 816 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:25:18,020 INFO L231 Difference]: Finished difference. Result has 366 places, 370 transitions, 774 flow [2025-03-13 22:25:18,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=366, PETRI_TRANSITIONS=370} [2025-03-13 22:25:18,021 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -113 predicate places. [2025-03-13 22:25:18,021 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 370 transitions, 774 flow [2025-03-13 22:25:18,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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-13 22:25:18,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:18,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:18,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:25:18,022 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:18,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:18,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1768681291, now seen corresponding path program 1 times [2025-03-13 22:25:18,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:18,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603640377] [2025-03-13 22:25:18,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:18,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:18,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-13 22:25:18,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-13 22:25:18,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:18,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:18,065 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-13 22:25:18,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:18,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603640377] [2025-03-13 22:25:18,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603640377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:18,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:18,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:18,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189174495] [2025-03-13 22:25:18,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:18,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:18,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:18,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:18,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:18,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 512 [2025-03-13 22:25:18,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 370 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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-13 22:25:18,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:18,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 512 [2025-03-13 22:25:18,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:18,211 INFO L124 PetriNetUnfolderBase]: 154/759 cut-off events. [2025-03-13 22:25:18,211 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-03-13 22:25:18,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 759 events. 154/759 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2271 event pairs, 22 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 965. Up to 180 conditions per place. [2025-03-13 22:25:18,218 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 22 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2025-03-13 22:25:18,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 369 transitions, 820 flow [2025-03-13 22:25:18,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:18,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:18,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-03-13 22:25:18,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.76953125 [2025-03-13 22:25:18,221 INFO L175 Difference]: Start difference. First operand has 366 places, 370 transitions, 774 flow. Second operand 3 states and 1182 transitions. [2025-03-13 22:25:18,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 369 transitions, 820 flow [2025-03-13 22:25:18,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 369 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:18,225 INFO L231 Difference]: Finished difference. Result has 365 places, 369 transitions, 772 flow [2025-03-13 22:25:18,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=365, PETRI_TRANSITIONS=369} [2025-03-13 22:25:18,226 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -114 predicate places. [2025-03-13 22:25:18,226 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 369 transitions, 772 flow [2025-03-13 22:25:18,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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-13 22:25:18,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:18,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:18,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:25:18,226 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:18,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:18,227 INFO L85 PathProgramCache]: Analyzing trace with hash -337314295, now seen corresponding path program 1 times [2025-03-13 22:25:18,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:18,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539276932] [2025-03-13 22:25:18,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:18,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:18,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-13 22:25:18,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-13 22:25:18,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:18,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:18,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-13 22:25:18,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:18,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539276932] [2025-03-13 22:25:18,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539276932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:18,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:18,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:18,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640167193] [2025-03-13 22:25:18,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:18,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:18,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:18,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:18,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:18,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 512 [2025-03-13 22:25:18,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 369 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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-13 22:25:18,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:18,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 512 [2025-03-13 22:25:18,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:18,409 INFO L124 PetriNetUnfolderBase]: 154/758 cut-off events. [2025-03-13 22:25:18,410 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-03-13 22:25:18,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 758 events. 154/758 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2272 event pairs, 22 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 962. Up to 177 conditions per place. [2025-03-13 22:25:18,418 INFO L140 encePairwiseOnDemand]: 510/512 looper letters, 20 selfloop transitions, 1 changer transitions 0/368 dead transitions. [2025-03-13 22:25:18,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 368 transitions, 812 flow [2025-03-13 22:25:18,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:18,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:18,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1191 transitions. [2025-03-13 22:25:18,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.775390625 [2025-03-13 22:25:18,421 INFO L175 Difference]: Start difference. First operand has 365 places, 369 transitions, 772 flow. Second operand 3 states and 1191 transitions. [2025-03-13 22:25:18,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 368 transitions, 812 flow [2025-03-13 22:25:18,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 368 transitions, 808 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:18,426 INFO L231 Difference]: Finished difference. Result has 364 places, 368 transitions, 768 flow [2025-03-13 22:25:18,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=364, PETRI_TRANSITIONS=368} [2025-03-13 22:25:18,427 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -115 predicate places. [2025-03-13 22:25:18,428 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 368 transitions, 768 flow [2025-03-13 22:25:18,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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-13 22:25:18,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:18,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:18,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:25:18,430 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:18,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:18,431 INFO L85 PathProgramCache]: Analyzing trace with hash -578628026, now seen corresponding path program 1 times [2025-03-13 22:25:18,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:18,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162877371] [2025-03-13 22:25:18,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:18,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:18,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-13 22:25:18,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-13 22:25:18,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:18,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:18,507 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-13 22:25:18,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:18,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162877371] [2025-03-13 22:25:18,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162877371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:18,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:18,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:18,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6994605] [2025-03-13 22:25:18,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:18,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:18,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:18,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:18,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:18,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 512 [2025-03-13 22:25:18,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 368 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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-13 22:25:18,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:18,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 512 [2025-03-13 22:25:18,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:18,663 INFO L124 PetriNetUnfolderBase]: 154/757 cut-off events. [2025-03-13 22:25:18,663 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-03-13 22:25:18,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 757 events. 154/757 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2261 event pairs, 22 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 961. Up to 179 conditions per place. [2025-03-13 22:25:18,669 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 21 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2025-03-13 22:25:18,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 367 transitions, 812 flow [2025-03-13 22:25:18,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:18,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2025-03-13 22:25:18,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2025-03-13 22:25:18,673 INFO L175 Difference]: Start difference. First operand has 364 places, 368 transitions, 768 flow. Second operand 3 states and 1184 transitions. [2025-03-13 22:25:18,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 367 transitions, 812 flow [2025-03-13 22:25:18,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 367 transitions, 811 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:25:18,678 INFO L231 Difference]: Finished difference. Result has 364 places, 367 transitions, 769 flow [2025-03-13 22:25:18,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=364, PETRI_TRANSITIONS=367} [2025-03-13 22:25:18,680 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -115 predicate places. [2025-03-13 22:25:18,680 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 367 transitions, 769 flow [2025-03-13 22:25:18,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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-13 22:25:18,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:18,680 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:18,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:25:18,681 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:18,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:18,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1776006899, now seen corresponding path program 1 times [2025-03-13 22:25:18,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:18,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733194605] [2025-03-13 22:25:18,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:18,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:18,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-13 22:25:18,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-13 22:25:18,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:18,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:18,760 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-13 22:25:18,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:18,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733194605] [2025-03-13 22:25:18,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733194605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:18,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:18,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:18,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611707699] [2025-03-13 22:25:18,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:18,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:18,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:18,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:18,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:18,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 512 [2025-03-13 22:25:18,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 367 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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-13 22:25:18,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:18,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 512 [2025-03-13 22:25:18,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:18,941 INFO L124 PetriNetUnfolderBase]: 154/756 cut-off events. [2025-03-13 22:25:18,941 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-03-13 22:25:18,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 756 events. 154/756 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2269 event pairs, 22 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 962. Up to 179 conditions per place. [2025-03-13 22:25:18,950 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 21 selfloop transitions, 2 changer transitions 0/366 dead transitions. [2025-03-13 22:25:18,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 366 transitions, 813 flow [2025-03-13 22:25:18,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2025-03-13 22:25:18,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2025-03-13 22:25:18,954 INFO L175 Difference]: Start difference. First operand has 364 places, 367 transitions, 769 flow. Second operand 3 states and 1184 transitions. [2025-03-13 22:25:18,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 366 transitions, 813 flow [2025-03-13 22:25:18,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 366 transitions, 809 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:18,960 INFO L231 Difference]: Finished difference. Result has 363 places, 366 transitions, 767 flow [2025-03-13 22:25:18,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=363, PETRI_TRANSITIONS=366} [2025-03-13 22:25:18,961 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -116 predicate places. [2025-03-13 22:25:18,961 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 366 transitions, 767 flow [2025-03-13 22:25:18,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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-13 22:25:18,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:18,962 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:18,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:25:18,962 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:18,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:18,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1342868003, now seen corresponding path program 1 times [2025-03-13 22:25:18,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:18,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398734815] [2025-03-13 22:25:18,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:18,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:18,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-13 22:25:18,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-13 22:25:18,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:18,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:19,020 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-13 22:25:19,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:19,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398734815] [2025-03-13 22:25:19,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398734815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:19,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:19,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:19,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968589187] [2025-03-13 22:25:19,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:19,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:19,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:19,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:19,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:19,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 512 [2025-03-13 22:25:19,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 366 transitions, 767 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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-13 22:25:19,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:19,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 512 [2025-03-13 22:25:19,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:19,156 INFO L124 PetriNetUnfolderBase]: 154/755 cut-off events. [2025-03-13 22:25:19,157 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-03-13 22:25:19,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 755 events. 154/755 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2270 event pairs, 22 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 961. Up to 179 conditions per place. [2025-03-13 22:25:19,164 INFO L140 encePairwiseOnDemand]: 509/512 looper letters, 21 selfloop transitions, 2 changer transitions 0/365 dead transitions. [2025-03-13 22:25:19,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 365 transitions, 811 flow [2025-03-13 22:25:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:19,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2025-03-13 22:25:19,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2025-03-13 22:25:19,166 INFO L175 Difference]: Start difference. First operand has 363 places, 366 transitions, 767 flow. Second operand 3 states and 1184 transitions. [2025-03-13 22:25:19,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 365 transitions, 811 flow [2025-03-13 22:25:19,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 365 transitions, 807 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:19,171 INFO L231 Difference]: Finished difference. Result has 362 places, 365 transitions, 765 flow [2025-03-13 22:25:19,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=765, PETRI_PLACES=362, PETRI_TRANSITIONS=365} [2025-03-13 22:25:19,172 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -117 predicate places. [2025-03-13 22:25:19,172 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 365 transitions, 765 flow [2025-03-13 22:25:19,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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-13 22:25:19,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:19,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:19,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:25:19,173 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err49ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:19,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:19,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1922075650, now seen corresponding path program 1 times [2025-03-13 22:25:19,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:19,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189991005] [2025-03-13 22:25:19,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:19,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:19,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-13 22:25:19,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-13 22:25:19,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:19,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:19,270 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-13 22:25:19,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:19,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189991005] [2025-03-13 22:25:19,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189991005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:19,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:19,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:19,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964774634] [2025-03-13 22:25:19,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:19,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:19,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:19,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:19,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:19,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 512 [2025-03-13 22:25:19,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 365 transitions, 765 flow. Second operand has 3 states, 3 states have (on average 384.0) internal successors, (1152), 3 states have internal predecessors, (1152), 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-13 22:25:19,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:19,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 512 [2025-03-13 22:25:19,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:19,619 INFO L124 PetriNetUnfolderBase]: 612/2074 cut-off events. [2025-03-13 22:25:19,619 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2025-03-13 22:25:19,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3140 conditions, 2074 events. 612/2074 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 12578 event pairs, 88 based on Foata normal form. 0/1697 useless extension candidates. Maximal degree in co-relation 3074. Up to 566 conditions per place. [2025-03-13 22:25:19,641 INFO L140 encePairwiseOnDemand]: 503/512 looper letters, 31 selfloop transitions, 7 changer transitions 0/373 dead transitions. [2025-03-13 22:25:19,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 373 transitions, 870 flow [2025-03-13 22:25:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:19,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:19,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2025-03-13 22:25:19,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.771484375 [2025-03-13 22:25:19,644 INFO L175 Difference]: Start difference. First operand has 362 places, 365 transitions, 765 flow. Second operand 3 states and 1185 transitions. [2025-03-13 22:25:19,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 373 transitions, 870 flow [2025-03-13 22:25:19,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 373 transitions, 866 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:19,649 INFO L231 Difference]: Finished difference. Result has 359 places, 362 transitions, 778 flow [2025-03-13 22:25:19,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=778, PETRI_PLACES=359, PETRI_TRANSITIONS=362} [2025-03-13 22:25:19,649 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -120 predicate places. [2025-03-13 22:25:19,649 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 362 transitions, 778 flow [2025-03-13 22:25:19,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 384.0) internal successors, (1152), 3 states have internal predecessors, (1152), 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-13 22:25:19,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:19,650 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:19,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:25:19,650 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:19,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:19,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1043299386, now seen corresponding path program 1 times [2025-03-13 22:25:19,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:19,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012955971] [2025-03-13 22:25:19,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:19,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:19,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-13 22:25:19,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-13 22:25:19,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:19,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:19,703 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-13 22:25:19,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:19,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012955971] [2025-03-13 22:25:19,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012955971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:19,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:19,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:19,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735242160] [2025-03-13 22:25:19,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:19,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:19,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:19,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:19,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:19,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 512 [2025-03-13 22:25:19,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 362 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 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-13 22:25:19,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:19,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 512 [2025-03-13 22:25:19,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:20,102 INFO L124 PetriNetUnfolderBase]: 750/2321 cut-off events. [2025-03-13 22:25:20,102 INFO L125 PetriNetUnfolderBase]: For 1396/1478 co-relation queries the response was YES. [2025-03-13 22:25:20,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3829 conditions, 2321 events. 750/2321 cut-off events. For 1396/1478 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 14000 event pairs, 86 based on Foata normal form. 0/1950 useless extension candidates. Maximal degree in co-relation 3763. Up to 668 conditions per place. [2025-03-13 22:25:20,129 INFO L140 encePairwiseOnDemand]: 507/512 looper letters, 32 selfloop transitions, 4 changer transitions 0/374 dead transitions. [2025-03-13 22:25:20,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 374 transitions, 908 flow [2025-03-13 22:25:20,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:20,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1198 transitions. [2025-03-13 22:25:20,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7799479166666666 [2025-03-13 22:25:20,132 INFO L175 Difference]: Start difference. First operand has 359 places, 362 transitions, 778 flow. Second operand 3 states and 1198 transitions. [2025-03-13 22:25:20,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 374 transitions, 908 flow [2025-03-13 22:25:20,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 374 transitions, 895 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:25:20,138 INFO L231 Difference]: Finished difference. Result has 359 places, 361 transitions, 783 flow [2025-03-13 22:25:20,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=359, PETRI_TRANSITIONS=361} [2025-03-13 22:25:20,139 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -120 predicate places. [2025-03-13 22:25:20,139 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 361 transitions, 783 flow [2025-03-13 22:25:20,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 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-13 22:25:20,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:20,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:20,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 22:25:20,140 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:20,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:20,140 INFO L85 PathProgramCache]: Analyzing trace with hash 283903967, now seen corresponding path program 1 times [2025-03-13 22:25:20,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:20,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788965767] [2025-03-13 22:25:20,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:20,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:20,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-03-13 22:25:20,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-03-13 22:25:20,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:20,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:20,214 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-13 22:25:20,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:20,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788965767] [2025-03-13 22:25:20,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788965767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:20,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:20,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:20,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814924790] [2025-03-13 22:25:20,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:20,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:20,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:20,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:20,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:20,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 512 [2025-03-13 22:25:20,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 361 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 390.6666666666667) internal successors, (1172), 3 states have internal predecessors, (1172), 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-13 22:25:20,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:20,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 512 [2025-03-13 22:25:20,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:20,597 INFO L124 PetriNetUnfolderBase]: 794/2505 cut-off events. [2025-03-13 22:25:20,597 INFO L125 PetriNetUnfolderBase]: For 1794/1826 co-relation queries the response was YES. [2025-03-13 22:25:20,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4380 conditions, 2505 events. 794/2505 cut-off events. For 1794/1826 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 16581 event pairs, 42 based on Foata normal form. 4/2162 useless extension candidates. Maximal degree in co-relation 4313. Up to 824 conditions per place. [2025-03-13 22:25:20,624 INFO L140 encePairwiseOnDemand]: 507/512 looper letters, 31 selfloop transitions, 4 changer transitions 0/372 dead transitions. [2025-03-13 22:25:20,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 372 transitions, 911 flow [2025-03-13 22:25:20,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1197 transitions. [2025-03-13 22:25:20,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.779296875 [2025-03-13 22:25:20,627 INFO L175 Difference]: Start difference. First operand has 359 places, 361 transitions, 783 flow. Second operand 3 states and 1197 transitions. [2025-03-13 22:25:20,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 372 transitions, 911 flow [2025-03-13 22:25:20,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 372 transitions, 904 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:25:20,633 INFO L231 Difference]: Finished difference. Result has 359 places, 360 transitions, 791 flow [2025-03-13 22:25:20,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=791, PETRI_PLACES=359, PETRI_TRANSITIONS=360} [2025-03-13 22:25:20,634 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -120 predicate places. [2025-03-13 22:25:20,634 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 360 transitions, 791 flow [2025-03-13 22:25:20,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 390.6666666666667) internal successors, (1172), 3 states have internal predecessors, (1172), 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-13 22:25:20,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:20,639 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:25:20,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-13 22:25:20,639 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err49ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 224 more)] === [2025-03-13 22:25:20,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:20,640 INFO L85 PathProgramCache]: Analyzing trace with hash 146118526, now seen corresponding path program 1 times [2025-03-13 22:25:20,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:20,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978898405] [2025-03-13 22:25:20,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:20,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:20,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-13 22:25:20,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-13 22:25:20,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:20,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:20,711 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-13 22:25:20,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:20,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978898405] [2025-03-13 22:25:20,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978898405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:20,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:20,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:20,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552958981] [2025-03-13 22:25:20,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:20,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:20,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:20,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:20,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:20,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 512 [2025-03-13 22:25:20,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 360 transitions, 791 flow. Second operand has 3 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 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-13 22:25:20,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:20,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 512 [2025-03-13 22:25:20,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:20,958 INFO L124 PetriNetUnfolderBase]: 243/1290 cut-off events. [2025-03-13 22:25:20,958 INFO L125 PetriNetUnfolderBase]: For 774/806 co-relation queries the response was YES. [2025-03-13 22:25:20,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2118 conditions, 1290 events. 243/1290 cut-off events. For 774/806 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6530 event pairs, 42 based on Foata normal form. 64/1189 useless extension candidates. Maximal degree in co-relation 2049. Up to 345 conditions per place. [2025-03-13 22:25:20,967 INFO L140 encePairwiseOnDemand]: 510/512 looper letters, 0 selfloop transitions, 0 changer transitions 359/359 dead transitions. [2025-03-13 22:25:20,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 359 transitions, 829 flow [2025-03-13 22:25:20,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:20,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2025-03-13 22:25:20,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7747395833333334 [2025-03-13 22:25:20,971 INFO L175 Difference]: Start difference. First operand has 359 places, 360 transitions, 791 flow. Second operand 3 states and 1190 transitions. [2025-03-13 22:25:20,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 359 transitions, 829 flow [2025-03-13 22:25:20,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 359 transitions, 825 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:25:20,976 INFO L231 Difference]: Finished difference. Result has 359 places, 0 transitions, 0 flow [2025-03-13 22:25:20,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=512, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=359, PETRI_TRANSITIONS=0} [2025-03-13 22:25:20,976 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, -120 predicate places. [2025-03-13 22:25:20,976 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 0 transitions, 0 flow [2025-03-13 22:25:20,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 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-13 22:25:20,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (227 of 228 remaining) [2025-03-13 22:25:20,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (226 of 228 remaining) [2025-03-13 22:25:20,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (225 of 228 remaining) [2025-03-13 22:25:20,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (224 of 228 remaining) [2025-03-13 22:25:20,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (223 of 228 remaining) [2025-03-13 22:25:20,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (222 of 228 remaining) [2025-03-13 22:25:20,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (221 of 228 remaining) [2025-03-13 22:25:20,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (220 of 228 remaining) [2025-03-13 22:25:20,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (219 of 228 remaining) [2025-03-13 22:25:20,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (218 of 228 remaining) [2025-03-13 22:25:20,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (217 of 228 remaining) [2025-03-13 22:25:20,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (216 of 228 remaining) [2025-03-13 22:25:20,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (215 of 228 remaining) [2025-03-13 22:25:20,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (214 of 228 remaining) [2025-03-13 22:25:20,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (213 of 228 remaining) [2025-03-13 22:25:20,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (212 of 228 remaining) [2025-03-13 22:25:20,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (211 of 228 remaining) [2025-03-13 22:25:20,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (210 of 228 remaining) [2025-03-13 22:25:20,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (209 of 228 remaining) [2025-03-13 22:25:20,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (208 of 228 remaining) [2025-03-13 22:25:20,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (207 of 228 remaining) [2025-03-13 22:25:20,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (206 of 228 remaining) [2025-03-13 22:25:20,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (205 of 228 remaining) [2025-03-13 22:25:20,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (204 of 228 remaining) [2025-03-13 22:25:20,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (203 of 228 remaining) [2025-03-13 22:25:20,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (202 of 228 remaining) [2025-03-13 22:25:20,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (201 of 228 remaining) [2025-03-13 22:25:20,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (200 of 228 remaining) [2025-03-13 22:25:20,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (199 of 228 remaining) [2025-03-13 22:25:20,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (198 of 228 remaining) [2025-03-13 22:25:20,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (197 of 228 remaining) [2025-03-13 22:25:20,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (196 of 228 remaining) [2025-03-13 22:25:20,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (195 of 228 remaining) [2025-03-13 22:25:20,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (194 of 228 remaining) [2025-03-13 22:25:20,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (193 of 228 remaining) [2025-03-13 22:25:20,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (192 of 228 remaining) [2025-03-13 22:25:20,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (191 of 228 remaining) [2025-03-13 22:25:20,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (190 of 228 remaining) [2025-03-13 22:25:20,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (189 of 228 remaining) [2025-03-13 22:25:20,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (188 of 228 remaining) [2025-03-13 22:25:20,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (187 of 228 remaining) [2025-03-13 22:25:20,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (186 of 228 remaining) [2025-03-13 22:25:20,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (185 of 228 remaining) [2025-03-13 22:25:20,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (184 of 228 remaining) [2025-03-13 22:25:20,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (183 of 228 remaining) [2025-03-13 22:25:20,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (182 of 228 remaining) [2025-03-13 22:25:20,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (181 of 228 remaining) [2025-03-13 22:25:20,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (180 of 228 remaining) [2025-03-13 22:25:20,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (179 of 228 remaining) [2025-03-13 22:25:20,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (178 of 228 remaining) [2025-03-13 22:25:20,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (177 of 228 remaining) [2025-03-13 22:25:20,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (176 of 228 remaining) [2025-03-13 22:25:20,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (175 of 228 remaining) [2025-03-13 22:25:20,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (174 of 228 remaining) [2025-03-13 22:25:20,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (173 of 228 remaining) [2025-03-13 22:25:20,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (172 of 228 remaining) [2025-03-13 22:25:20,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (171 of 228 remaining) [2025-03-13 22:25:20,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (170 of 228 remaining) [2025-03-13 22:25:20,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (169 of 228 remaining) [2025-03-13 22:25:20,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (168 of 228 remaining) [2025-03-13 22:25:20,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (167 of 228 remaining) [2025-03-13 22:25:20,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (166 of 228 remaining) [2025-03-13 22:25:20,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (165 of 228 remaining) [2025-03-13 22:25:20,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (164 of 228 remaining) [2025-03-13 22:25:20,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (163 of 228 remaining) [2025-03-13 22:25:20,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (162 of 228 remaining) [2025-03-13 22:25:20,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (161 of 228 remaining) [2025-03-13 22:25:20,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (160 of 228 remaining) [2025-03-13 22:25:20,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (159 of 228 remaining) [2025-03-13 22:25:20,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (158 of 228 remaining) [2025-03-13 22:25:20,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (157 of 228 remaining) [2025-03-13 22:25:20,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (156 of 228 remaining) [2025-03-13 22:25:20,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (155 of 228 remaining) [2025-03-13 22:25:20,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (154 of 228 remaining) [2025-03-13 22:25:20,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (153 of 228 remaining) [2025-03-13 22:25:20,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (152 of 228 remaining) [2025-03-13 22:25:20,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (151 of 228 remaining) [2025-03-13 22:25:20,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (150 of 228 remaining) [2025-03-13 22:25:20,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (149 of 228 remaining) [2025-03-13 22:25:20,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (148 of 228 remaining) [2025-03-13 22:25:20,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (147 of 228 remaining) [2025-03-13 22:25:20,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (146 of 228 remaining) [2025-03-13 22:25:20,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (145 of 228 remaining) [2025-03-13 22:25:20,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (144 of 228 remaining) [2025-03-13 22:25:20,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (143 of 228 remaining) [2025-03-13 22:25:20,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (142 of 228 remaining) [2025-03-13 22:25:20,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (141 of 228 remaining) [2025-03-13 22:25:20,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (140 of 228 remaining) [2025-03-13 22:25:20,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (139 of 228 remaining) [2025-03-13 22:25:20,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (138 of 228 remaining) [2025-03-13 22:25:20,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (137 of 228 remaining) [2025-03-13 22:25:20,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (136 of 228 remaining) [2025-03-13 22:25:20,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (135 of 228 remaining) [2025-03-13 22:25:20,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (134 of 228 remaining) [2025-03-13 22:25:20,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (133 of 228 remaining) [2025-03-13 22:25:20,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (132 of 228 remaining) [2025-03-13 22:25:20,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (131 of 228 remaining) [2025-03-13 22:25:20,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (130 of 228 remaining) [2025-03-13 22:25:20,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (129 of 228 remaining) [2025-03-13 22:25:20,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (128 of 228 remaining) [2025-03-13 22:25:20,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (127 of 228 remaining) [2025-03-13 22:25:20,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (126 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (125 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (124 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (123 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (122 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (121 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (120 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (119 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (118 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (117 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (116 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (115 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (114 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (113 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (112 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (111 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (110 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (109 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (108 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (107 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (106 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (105 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (104 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (103 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (102 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (101 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (100 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (99 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (98 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (97 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (96 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (95 of 228 remaining) [2025-03-13 22:25:20,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (94 of 228 remaining) [2025-03-13 22:25:20,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (93 of 228 remaining) [2025-03-13 22:25:20,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (92 of 228 remaining) [2025-03-13 22:25:20,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (91 of 228 remaining) [2025-03-13 22:25:20,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (90 of 228 remaining) [2025-03-13 22:25:20,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (89 of 228 remaining) [2025-03-13 22:25:20,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (88 of 228 remaining) [2025-03-13 22:25:20,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (87 of 228 remaining) [2025-03-13 22:25:20,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (86 of 228 remaining) [2025-03-13 22:25:20,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (85 of 228 remaining) [2025-03-13 22:25:20,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (84 of 228 remaining) [2025-03-13 22:25:20,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (83 of 228 remaining) [2025-03-13 22:25:20,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (82 of 228 remaining) [2025-03-13 22:25:20,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (81 of 228 remaining) [2025-03-13 22:25:20,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (80 of 228 remaining) [2025-03-13 22:25:20,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (79 of 228 remaining) [2025-03-13 22:25:20,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (78 of 228 remaining) [2025-03-13 22:25:20,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (77 of 228 remaining) [2025-03-13 22:25:20,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (76 of 228 remaining) [2025-03-13 22:25:20,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (75 of 228 remaining) [2025-03-13 22:25:20,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (74 of 228 remaining) [2025-03-13 22:25:20,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (73 of 228 remaining) [2025-03-13 22:25:20,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (72 of 228 remaining) [2025-03-13 22:25:20,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (71 of 228 remaining) [2025-03-13 22:25:20,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (70 of 228 remaining) [2025-03-13 22:25:20,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (69 of 228 remaining) [2025-03-13 22:25:20,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (68 of 228 remaining) [2025-03-13 22:25:20,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (67 of 228 remaining) [2025-03-13 22:25:20,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (66 of 228 remaining) [2025-03-13 22:25:20,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (65 of 228 remaining) [2025-03-13 22:25:20,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (64 of 228 remaining) [2025-03-13 22:25:20,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (63 of 228 remaining) [2025-03-13 22:25:20,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (62 of 228 remaining) [2025-03-13 22:25:20,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (61 of 228 remaining) [2025-03-13 22:25:20,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (60 of 228 remaining) [2025-03-13 22:25:20,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (59 of 228 remaining) [2025-03-13 22:25:20,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (58 of 228 remaining) [2025-03-13 22:25:20,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (57 of 228 remaining) [2025-03-13 22:25:20,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (56 of 228 remaining) [2025-03-13 22:25:20,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (55 of 228 remaining) [2025-03-13 22:25:20,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (54 of 228 remaining) [2025-03-13 22:25:20,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (53 of 228 remaining) [2025-03-13 22:25:20,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (52 of 228 remaining) [2025-03-13 22:25:20,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (51 of 228 remaining) [2025-03-13 22:25:20,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (50 of 228 remaining) [2025-03-13 22:25:20,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (49 of 228 remaining) [2025-03-13 22:25:20,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (48 of 228 remaining) [2025-03-13 22:25:20,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (47 of 228 remaining) [2025-03-13 22:25:20,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (46 of 228 remaining) [2025-03-13 22:25:20,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (45 of 228 remaining) [2025-03-13 22:25:20,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (44 of 228 remaining) [2025-03-13 22:25:20,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (43 of 228 remaining) [2025-03-13 22:25:20,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (42 of 228 remaining) [2025-03-13 22:25:20,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (41 of 228 remaining) [2025-03-13 22:25:20,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (40 of 228 remaining) [2025-03-13 22:25:20,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (39 of 228 remaining) [2025-03-13 22:25:20,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 228 remaining) [2025-03-13 22:25:20,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (37 of 228 remaining) [2025-03-13 22:25:20,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (36 of 228 remaining) [2025-03-13 22:25:20,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (35 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (34 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (33 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (32 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (31 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (30 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (29 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (28 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (27 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (26 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (25 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (24 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (23 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (22 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (21 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (20 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (19 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (18 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (17 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (16 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (15 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (14 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (13 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (12 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (11 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (10 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (9 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (8 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (7 of 228 remaining) [2025-03-13 22:25:20,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (6 of 228 remaining) [2025-03-13 22:25:20,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (5 of 228 remaining) [2025-03-13 22:25:20,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (4 of 228 remaining) [2025-03-13 22:25:20,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (3 of 228 remaining) [2025-03-13 22:25:20,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (2 of 228 remaining) [2025-03-13 22:25:20,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (1 of 228 remaining) [2025-03-13 22:25:20,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (0 of 228 remaining) [2025-03-13 22:25:20,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-13 22:25:20,993 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-13 22:25:20,999 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:25:20,999 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:25:21,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:25:21 BasicIcfg [2025-03-13 22:25:21,005 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:25:21,006 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:25:21,006 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:25:21,006 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:25:21,007 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:13" (3/4) ... [2025-03-13 22:25:21,008 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 22:25:21,010 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-13 22:25:21,010 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-13 22:25:21,010 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-13 22:25:21,016 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-03-13 22:25:21,016 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 22:25:21,017 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 22:25:21,017 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 22:25:21,091 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:25:21,091 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:25:21,091 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:25:21,093 INFO L158 Benchmark]: Toolchain (without parser) took 9287.19ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 112.4MB in the beginning and 378.9MB in the end (delta: -266.6MB). Peak memory consumption was 173.3MB. Max. memory is 16.1GB. [2025-03-13 22:25:21,093 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:25:21,093 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.38ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 97.2MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 22:25:21,093 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.25ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 93.3MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:25:21,094 INFO L158 Benchmark]: Boogie Preprocessor took 59.33ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 89.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:25:21,094 INFO L158 Benchmark]: IcfgBuilder took 1609.28ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 37.4MB in the end (delta: 52.4MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. [2025-03-13 22:25:21,094 INFO L158 Benchmark]: TraceAbstraction took 7213.00ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 37.4MB in the beginning and 387.3MB in the end (delta: -349.9MB). Peak memory consumption was 94.7MB. Max. memory is 16.1GB. [2025-03-13 22:25:21,094 INFO L158 Benchmark]: Witness Printer took 85.32ms. Allocated memory is still 587.2MB. Free memory was 387.3MB in the beginning and 378.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:25:21,095 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.38ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 97.2MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.25ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 93.3MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.33ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 89.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1609.28ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 37.4MB in the end (delta: 52.4MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7213.00ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 37.4MB in the beginning and 387.3MB in the end (delta: -349.9MB). Peak memory consumption was 94.7MB. Max. memory is 16.1GB. * Witness Printer took 85.32ms. Allocated memory is still 587.2MB. Free memory was 387.3MB in the beginning and 378.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 52]: 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: 54]: 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: 54]: 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: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: 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: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: 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: 68]: 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: 68]: 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: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: 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 - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 173]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 142]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 173]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 148]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 173]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 148]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: 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 7 procedures, 648 locations, 228 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: 7.0s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 443 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1141 IncrementalHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 80 mSDtfsCounter, 1141 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1002occurred in iteration=0, InterpolantAutomatonStates: 81, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 3565 NumberOfCodeBlocks, 3565 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3539 ConstructedInterpolants, 0 QuantifiedInterpolants, 3704 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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 125 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 22:25:21,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE