./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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-2.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 5bf746ef76f8c8352051d8eb5f02d7a475e14d238622e290fcb51135a3348206 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:13:37,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:13:37,735 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:13:37,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:13:37,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:13:37,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:13:37,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:13:37,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:13:37,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:13:37,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:13:37,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:13:37,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:13:37,759 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:13:37,759 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:13:37,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:13:37,759 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:13:37,759 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:13:37,759 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:13:37,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:13:37,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:13:37,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:13:37,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:13:37,760 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:13:37,760 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:13:37,760 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:13:37,760 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:13:37,761 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:13:37,761 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:13:37,761 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:13:37,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:13:37,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:13:37,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:13:37,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:13:37,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:13:37,761 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:13:37,761 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:13:37,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:13:37,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:13:37,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:13:37,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:13:37,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:13:37,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:13:37,761 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 -> 5bf746ef76f8c8352051d8eb5f02d7a475e14d238622e290fcb51135a3348206 [2025-03-17 11:13:37,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:13:37,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:13:38,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:13:38,002 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:13:38,002 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:13:38,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c [2025-03-17 11:13:39,131 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e0961ea/6f1ea63b2ea848cc81a66605067c57c4/FLAG70b369eda [2025-03-17 11:13:39,365 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:13:39,366 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c [2025-03-17 11:13:39,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e0961ea/6f1ea63b2ea848cc81a66605067c57c4/FLAG70b369eda [2025-03-17 11:13:39,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e0961ea/6f1ea63b2ea848cc81a66605067c57c4 [2025-03-17 11:13:39,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:13:39,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:13:39,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:13:39,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:13:39,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:13:39,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:13:39" (1/1) ... [2025-03-17 11:13:39,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cce8b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:39, skipping insertion in model container [2025-03-17 11:13:39,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:13:39" (1/1) ... [2025-03-17 11:13:39,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:13:39,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:13:39,586 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:13:39,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:13:39,631 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:13:39,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:39 WrapperNode [2025-03-17 11:13:39,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:13:39,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:13:39,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:13:39,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:13:39,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:39" (1/1) ... [2025-03-17 11:13:39,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:39" (1/1) ... [2025-03-17 11:13:39,680 INFO L138 Inliner]: procedures = 25, calls = 74, calls flagged for inlining = 28, calls inlined = 34, statements flattened = 1037 [2025-03-17 11:13:39,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:13:39,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:13:39,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:13:39,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:13:39,687 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:39" (1/1) ... [2025-03-17 11:13:39,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:39" (1/1) ... [2025-03-17 11:13:39,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:39" (1/1) ... [2025-03-17 11:13:39,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:39" (1/1) ... [2025-03-17 11:13:39,711 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:39" (1/1) ... [2025-03-17 11:13:39,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:39" (1/1) ... [2025-03-17 11:13:39,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:39" (1/1) ... [2025-03-17 11:13:39,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:39" (1/1) ... [2025-03-17 11:13:39,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:13:39,738 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:13:39,738 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:13:39,738 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:13:39,739 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:39" (1/1) ... [2025-03-17 11:13:39,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:13:39,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:13:39,767 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-17 11:13:39,770 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-17 11:13:39,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:13:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:13:39,790 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:13:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:13:39,790 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:13:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 11:13:39,790 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 11:13:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-17 11:13:39,790 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-17 11:13:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:13:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:13:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 11:13:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 11:13:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:13:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:13:39,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:13:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:13:39,792 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:13:39,907 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:13:39,908 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:13:40,841 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:13:40,841 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:13:41,416 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:13:41,419 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:13:41,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:41 BoogieIcfgContainer [2025-03-17 11:13:41,419 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:13:41,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:13:41,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:13:41,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:13:41,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:13:39" (1/3) ... [2025-03-17 11:13:41,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c677581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:13:41, skipping insertion in model container [2025-03-17 11:13:41,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:39" (2/3) ... [2025-03-17 11:13:41,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c677581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:13:41, skipping insertion in model container [2025-03-17 11:13:41,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:41" (3/3) ... [2025-03-17 11:13:41,430 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-2.wvr-bad.c [2025-03-17 11:13:41,446 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:13:41,447 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-commit-2.wvr-bad.c that has 5 procedures, 656 locations, 1 initial locations, 8 loop locations, and 182 error locations. [2025-03-17 11:13:41,448 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:13:41,634 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-17 11:13:41,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 668 places, 688 transitions, 1404 flow [2025-03-17 11:13:41,917 INFO L124 PetriNetUnfolderBase]: 33/684 cut-off events. [2025-03-17 11:13:41,920 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:13:41,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 684 events. 33/684 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1648 event pairs, 0 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 620. Up to 8 conditions per place. [2025-03-17 11:13:41,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 668 places, 688 transitions, 1404 flow [2025-03-17 11:13:41,950 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 648 places, 667 transitions, 1358 flow [2025-03-17 11:13:41,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:13:41,966 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;@4a1c9e39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:13:41,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 336 error locations. [2025-03-17 11:13:41,975 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:13:41,976 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2025-03-17 11:13:41,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:13:41,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:41,977 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] [2025-03-17 11:13:41,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:41,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:41,981 INFO L85 PathProgramCache]: Analyzing trace with hash -373819585, now seen corresponding path program 1 times [2025-03-17 11:13:41,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:41,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887010384] [2025-03-17 11:13:41,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:41,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:42,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:13:42,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:13:42,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:42,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:42,145 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-17 11:13:42,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:42,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887010384] [2025-03-17 11:13:42,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887010384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:42,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:42,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:42,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829728822] [2025-03-17 11:13:42,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:42,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:42,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:42,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:42,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:42,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 688 [2025-03-17 11:13:42,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 667 transitions, 1358 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:13:42,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:42,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 688 [2025-03-17 11:13:42,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:42,462 INFO L124 PetriNetUnfolderBase]: 56/552 cut-off events. [2025-03-17 11:13:42,463 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-17 11:13:42,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 552 events. 56/552 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 622 event pairs, 0 based on Foata normal form. 24/489 useless extension candidates. Maximal degree in co-relation 539. Up to 61 conditions per place. [2025-03-17 11:13:42,467 INFO L140 encePairwiseOnDemand]: 535/688 looper letters, 24 selfloop transitions, 2 changer transitions 8/516 dead transitions. [2025-03-17 11:13:42,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 516 transitions, 1108 flow [2025-03-17 11:13:42,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1701 transitions. [2025-03-17 11:13:42,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8241279069767442 [2025-03-17 11:13:42,482 INFO L175 Difference]: Start difference. First operand has 648 places, 667 transitions, 1358 flow. Second operand 3 states and 1701 transitions. [2025-03-17 11:13:42,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 516 transitions, 1108 flow [2025-03-17 11:13:42,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 503 places, 516 transitions, 1092 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 11:13:42,500 INFO L231 Difference]: Finished difference. Result has 503 places, 508 transitions, 1028 flow [2025-03-17 11:13:42,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=501, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1028, PETRI_PLACES=503, PETRI_TRANSITIONS=508} [2025-03-17 11:13:42,507 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -145 predicate places. [2025-03-17 11:13:42,513 INFO L471 AbstractCegarLoop]: Abstraction has has 503 places, 508 transitions, 1028 flow [2025-03-17 11:13:42,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:13:42,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:42,514 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] [2025-03-17 11:13:42,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:13:42,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:42,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:42,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1738127595, now seen corresponding path program 1 times [2025-03-17 11:13:42,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:42,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539693509] [2025-03-17 11:13:42,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:42,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:42,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 11:13:42,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 11:13:42,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:42,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:42,582 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-17 11:13:42,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:42,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539693509] [2025-03-17 11:13:42,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539693509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:42,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:42,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:42,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137086065] [2025-03-17 11:13:42,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:42,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:42,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:42,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:42,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:42,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 688 [2025-03-17 11:13:42,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 508 transitions, 1028 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:13:42,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:42,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 688 [2025-03-17 11:13:42,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:42,742 INFO L124 PetriNetUnfolderBase]: 56/543 cut-off events. [2025-03-17 11:13:42,742 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:13:42,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 543 events. 56/543 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 608 event pairs, 0 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 568. Up to 61 conditions per place. [2025-03-17 11:13:42,747 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 24 selfloop transitions, 2 changer transitions 0/507 dead transitions. [2025-03-17 11:13:42,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 507 transitions, 1078 flow [2025-03-17 11:13:42,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:42,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-03-17 11:13:42,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751453488372093 [2025-03-17 11:13:42,754 INFO L175 Difference]: Start difference. First operand has 503 places, 508 transitions, 1028 flow. Second operand 3 states and 1551 transitions. [2025-03-17 11:13:42,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 507 transitions, 1078 flow [2025-03-17 11:13:42,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 507 transitions, 1074 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:42,763 INFO L231 Difference]: Finished difference. Result has 494 places, 507 transitions, 1026 flow [2025-03-17 11:13:42,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=492, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1026, PETRI_PLACES=494, PETRI_TRANSITIONS=507} [2025-03-17 11:13:42,765 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -154 predicate places. [2025-03-17 11:13:42,765 INFO L471 AbstractCegarLoop]: Abstraction has has 494 places, 507 transitions, 1026 flow [2025-03-17 11:13:42,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:13:42,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:42,767 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] [2025-03-17 11:13:42,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:13:42,767 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:42,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:42,768 INFO L85 PathProgramCache]: Analyzing trace with hash -661660883, now seen corresponding path program 1 times [2025-03-17 11:13:42,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:42,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436342144] [2025-03-17 11:13:42,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:42,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:42,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:13:42,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:13:42,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:42,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:42,836 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-17 11:13:42,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:42,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436342144] [2025-03-17 11:13:42,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436342144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:42,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:42,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:42,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471282285] [2025-03-17 11:13:42,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:42,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:42,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:42,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:42,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:42,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 688 [2025-03-17 11:13:42,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 507 transitions, 1026 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:13:42,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:42,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 688 [2025-03-17 11:13:42,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:43,011 INFO L124 PetriNetUnfolderBase]: 56/542 cut-off events. [2025-03-17 11:13:43,012 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:13:43,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 542 events. 56/542 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 605 event pairs, 0 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 559. Up to 61 conditions per place. [2025-03-17 11:13:43,018 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 24 selfloop transitions, 2 changer transitions 0/506 dead transitions. [2025-03-17 11:13:43,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 506 transitions, 1076 flow [2025-03-17 11:13:43,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:43,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-03-17 11:13:43,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751453488372093 [2025-03-17 11:13:43,023 INFO L175 Difference]: Start difference. First operand has 494 places, 507 transitions, 1026 flow. Second operand 3 states and 1551 transitions. [2025-03-17 11:13:43,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 506 transitions, 1076 flow [2025-03-17 11:13:43,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 506 transitions, 1072 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:43,031 INFO L231 Difference]: Finished difference. Result has 493 places, 506 transitions, 1024 flow [2025-03-17 11:13:43,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1024, PETRI_PLACES=493, PETRI_TRANSITIONS=506} [2025-03-17 11:13:43,032 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -155 predicate places. [2025-03-17 11:13:43,032 INFO L471 AbstractCegarLoop]: Abstraction has has 493 places, 506 transitions, 1024 flow [2025-03-17 11:13:43,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:13:43,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:43,035 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] [2025-03-17 11:13:43,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:13:43,035 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:43,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:43,036 INFO L85 PathProgramCache]: Analyzing trace with hash 243815384, now seen corresponding path program 1 times [2025-03-17 11:13:43,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:43,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604174799] [2025-03-17 11:13:43,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:43,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:43,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 11:13:43,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 11:13:43,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:43,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:43,094 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-17 11:13:43,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:43,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604174799] [2025-03-17 11:13:43,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604174799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:43,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:43,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:43,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304244942] [2025-03-17 11:13:43,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:43,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:43,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:43,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:43,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:43,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 688 [2025-03-17 11:13:43,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 506 transitions, 1024 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 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-17 11:13:43,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:43,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 688 [2025-03-17 11:13:43,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:43,290 INFO L124 PetriNetUnfolderBase]: 107/750 cut-off events. [2025-03-17 11:13:43,291 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:13:43,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 750 events. 107/750 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1627 event pairs, 0 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 814. Up to 69 conditions per place. [2025-03-17 11:13:43,296 INFO L140 encePairwiseOnDemand]: 683/688 looper letters, 38 selfloop transitions, 4 changer transitions 0/524 dead transitions. [2025-03-17 11:13:43,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 524 transitions, 1151 flow [2025-03-17 11:13:43,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:43,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:43,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1579 transitions. [2025-03-17 11:13:43,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7650193798449613 [2025-03-17 11:13:43,300 INFO L175 Difference]: Start difference. First operand has 493 places, 506 transitions, 1024 flow. Second operand 3 states and 1579 transitions. [2025-03-17 11:13:43,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 524 transitions, 1151 flow [2025-03-17 11:13:43,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 524 transitions, 1147 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:43,308 INFO L231 Difference]: Finished difference. Result has 493 places, 508 transitions, 1042 flow [2025-03-17 11:13:43,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1042, PETRI_PLACES=493, PETRI_TRANSITIONS=508} [2025-03-17 11:13:43,310 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -155 predicate places. [2025-03-17 11:13:43,310 INFO L471 AbstractCegarLoop]: Abstraction has has 493 places, 508 transitions, 1042 flow [2025-03-17 11:13:43,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 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-17 11:13:43,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:43,312 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] [2025-03-17 11:13:43,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:13:43,312 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:43,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:43,314 INFO L85 PathProgramCache]: Analyzing trace with hash 754812836, now seen corresponding path program 1 times [2025-03-17 11:13:43,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:43,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100455363] [2025-03-17 11:13:43,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:43,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:43,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 11:13:43,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 11:13:43,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:43,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:43,359 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-17 11:13:43,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:43,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100455363] [2025-03-17 11:13:43,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100455363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:43,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:43,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:43,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918455518] [2025-03-17 11:13:43,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:43,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:43,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:43,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:43,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:43,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 688 [2025-03-17 11:13:43,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 508 transitions, 1042 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:13:43,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:43,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 688 [2025-03-17 11:13:43,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:43,506 INFO L124 PetriNetUnfolderBase]: 107/701 cut-off events. [2025-03-17 11:13:43,507 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-17 11:13:43,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 701 events. 107/701 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1405 event pairs, 3 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 523. Up to 115 conditions per place. [2025-03-17 11:13:43,514 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 26 selfloop transitions, 2 changer transitions 0/507 dead transitions. [2025-03-17 11:13:43,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 507 transitions, 1096 flow [2025-03-17 11:13:43,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:43,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:43,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-03-17 11:13:43,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752422480620155 [2025-03-17 11:13:43,519 INFO L175 Difference]: Start difference. First operand has 493 places, 508 transitions, 1042 flow. Second operand 3 states and 1553 transitions. [2025-03-17 11:13:43,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 507 transitions, 1096 flow [2025-03-17 11:13:43,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 507 transitions, 1092 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:43,527 INFO L231 Difference]: Finished difference. Result has 493 places, 507 transitions, 1040 flow [2025-03-17 11:13:43,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1040, PETRI_PLACES=493, PETRI_TRANSITIONS=507} [2025-03-17 11:13:43,528 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -155 predicate places. [2025-03-17 11:13:43,529 INFO L471 AbstractCegarLoop]: Abstraction has has 493 places, 507 transitions, 1040 flow [2025-03-17 11:13:43,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:13:43,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:43,530 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] [2025-03-17 11:13:43,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:13:43,530 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:43,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:43,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1816777495, now seen corresponding path program 1 times [2025-03-17 11:13:43,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:43,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985085386] [2025-03-17 11:13:43,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:43,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:43,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 11:13:43,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 11:13:43,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:43,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:43,566 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-17 11:13:43,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:43,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985085386] [2025-03-17 11:13:43,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985085386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:43,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:43,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:43,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708135613] [2025-03-17 11:13:43,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:43,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:43,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:43,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:43,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:43,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 688 [2025-03-17 11:13:43,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 507 transitions, 1040 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 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-17 11:13:43,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:43,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 688 [2025-03-17 11:13:43,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:43,699 INFO L124 PetriNetUnfolderBase]: 107/700 cut-off events. [2025-03-17 11:13:43,699 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-17 11:13:43,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 700 events. 107/700 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1381 event pairs, 3 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 781. Up to 113 conditions per place. [2025-03-17 11:13:43,705 INFO L140 encePairwiseOnDemand]: 686/688 looper letters, 25 selfloop transitions, 1 changer transitions 0/506 dead transitions. [2025-03-17 11:13:43,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 506 transitions, 1090 flow [2025-03-17 11:13:43,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:43,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1560 transitions. [2025-03-17 11:13:43,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7558139534883721 [2025-03-17 11:13:43,709 INFO L175 Difference]: Start difference. First operand has 493 places, 507 transitions, 1040 flow. Second operand 3 states and 1560 transitions. [2025-03-17 11:13:43,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 506 transitions, 1090 flow [2025-03-17 11:13:43,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 506 transitions, 1086 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:43,715 INFO L231 Difference]: Finished difference. Result has 492 places, 506 transitions, 1036 flow [2025-03-17 11:13:43,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1036, PETRI_PLACES=492, PETRI_TRANSITIONS=506} [2025-03-17 11:13:43,717 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -156 predicate places. [2025-03-17 11:13:43,717 INFO L471 AbstractCegarLoop]: Abstraction has has 492 places, 506 transitions, 1036 flow [2025-03-17 11:13:43,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 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-17 11:13:43,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:43,718 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] [2025-03-17 11:13:43,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:13:43,718 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:43,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:43,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1505768459, now seen corresponding path program 1 times [2025-03-17 11:13:43,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:43,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639647232] [2025-03-17 11:13:43,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:43,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:43,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 11:13:43,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 11:13:43,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:43,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:44,225 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-17 11:13:44,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:44,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639647232] [2025-03-17 11:13:44,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639647232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:44,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:44,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:13:44,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336380733] [2025-03-17 11:13:44,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:44,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:13:44,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:44,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:13:44,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:13:44,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 688 [2025-03-17 11:13:44,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 506 transitions, 1036 flow. Second operand has 6 states, 6 states have (on average 461.5) internal successors, (2769), 6 states have internal predecessors, (2769), 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-17 11:13:44,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:44,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 688 [2025-03-17 11:13:44,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:44,706 INFO L124 PetriNetUnfolderBase]: 107/696 cut-off events. [2025-03-17 11:13:44,706 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-17 11:13:44,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 696 events. 107/696 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1372 event pairs, 3 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 826. Up to 144 conditions per place. [2025-03-17 11:13:44,713 INFO L140 encePairwiseOnDemand]: 664/688 looper letters, 55 selfloop transitions, 20 changer transitions 0/502 dead transitions. [2025-03-17 11:13:44,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 502 transitions, 1178 flow [2025-03-17 11:13:44,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:13:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:13:44,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2836 transitions. [2025-03-17 11:13:44,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.687015503875969 [2025-03-17 11:13:44,731 INFO L175 Difference]: Start difference. First operand has 492 places, 506 transitions, 1036 flow. Second operand 6 states and 2836 transitions. [2025-03-17 11:13:44,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 502 transitions, 1178 flow [2025-03-17 11:13:44,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 502 transitions, 1177 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:44,738 INFO L231 Difference]: Finished difference. Result has 492 places, 502 transitions, 1067 flow [2025-03-17 11:13:44,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=487, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1067, PETRI_PLACES=492, PETRI_TRANSITIONS=502} [2025-03-17 11:13:44,741 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -156 predicate places. [2025-03-17 11:13:44,741 INFO L471 AbstractCegarLoop]: Abstraction has has 492 places, 502 transitions, 1067 flow [2025-03-17 11:13:44,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 461.5) internal successors, (2769), 6 states have internal predecessors, (2769), 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-17 11:13:44,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:44,743 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] [2025-03-17 11:13:44,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:13:44,743 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:44,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:44,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1386980192, now seen corresponding path program 1 times [2025-03-17 11:13:44,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:44,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457934467] [2025-03-17 11:13:44,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:44,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:44,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 11:13:44,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 11:13:44,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:44,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:44,791 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-17 11:13:44,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:44,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457934467] [2025-03-17 11:13:44,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457934467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:44,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:44,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:44,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904817182] [2025-03-17 11:13:44,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:44,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:44,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:44,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:44,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:44,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 688 [2025-03-17 11:13:44,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 502 transitions, 1067 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:13:44,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:44,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 688 [2025-03-17 11:13:44,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:44,925 INFO L124 PetriNetUnfolderBase]: 107/695 cut-off events. [2025-03-17 11:13:44,925 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-17 11:13:44,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 695 events. 107/695 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1370 event pairs, 3 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 804. Up to 115 conditions per place. [2025-03-17 11:13:44,932 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 26 selfloop transitions, 2 changer transitions 0/501 dead transitions. [2025-03-17 11:13:44,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 501 transitions, 1121 flow [2025-03-17 11:13:44,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:44,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-03-17 11:13:44,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752422480620155 [2025-03-17 11:13:44,936 INFO L175 Difference]: Start difference. First operand has 492 places, 502 transitions, 1067 flow. Second operand 3 states and 1553 transitions. [2025-03-17 11:13:44,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 501 transitions, 1121 flow [2025-03-17 11:13:44,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 488 places, 501 transitions, 1081 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:13:44,943 INFO L231 Difference]: Finished difference. Result has 488 places, 501 transitions, 1029 flow [2025-03-17 11:13:44,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1029, PETRI_PLACES=488, PETRI_TRANSITIONS=501} [2025-03-17 11:13:44,944 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -160 predicate places. [2025-03-17 11:13:44,944 INFO L471 AbstractCegarLoop]: Abstraction has has 488 places, 501 transitions, 1029 flow [2025-03-17 11:13:44,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:13:44,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:44,946 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] [2025-03-17 11:13:44,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:13:44,946 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:44,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:44,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1700784021, now seen corresponding path program 1 times [2025-03-17 11:13:44,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:44,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905422103] [2025-03-17 11:13:44,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:44,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:44,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 11:13:44,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 11:13:44,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:44,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:44,987 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-17 11:13:44,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:44,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905422103] [2025-03-17 11:13:44,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905422103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:44,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:44,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:44,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477760772] [2025-03-17 11:13:44,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:44,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:44,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:44,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:44,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:45,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 688 [2025-03-17 11:13:45,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 501 transitions, 1029 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:13:45,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:45,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 688 [2025-03-17 11:13:45,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:45,121 INFO L124 PetriNetUnfolderBase]: 107/694 cut-off events. [2025-03-17 11:13:45,122 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-17 11:13:45,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 694 events. 107/694 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1358 event pairs, 3 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 779. Up to 116 conditions per place. [2025-03-17 11:13:45,128 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 27 selfloop transitions, 2 changer transitions 0/500 dead transitions. [2025-03-17 11:13:45,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 500 transitions, 1085 flow [2025-03-17 11:13:45,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:45,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-03-17 11:13:45,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751453488372093 [2025-03-17 11:13:45,131 INFO L175 Difference]: Start difference. First operand has 488 places, 501 transitions, 1029 flow. Second operand 3 states and 1551 transitions. [2025-03-17 11:13:45,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 500 transitions, 1085 flow [2025-03-17 11:13:45,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 500 transitions, 1081 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:45,138 INFO L231 Difference]: Finished difference. Result has 487 places, 500 transitions, 1027 flow [2025-03-17 11:13:45,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1027, PETRI_PLACES=487, PETRI_TRANSITIONS=500} [2025-03-17 11:13:45,140 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -161 predicate places. [2025-03-17 11:13:45,140 INFO L471 AbstractCegarLoop]: Abstraction has has 487 places, 500 transitions, 1027 flow [2025-03-17 11:13:45,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:13:45,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:45,141 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] [2025-03-17 11:13:45,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:13:45,142 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:45,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:45,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1473302477, now seen corresponding path program 1 times [2025-03-17 11:13:45,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:45,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833008281] [2025-03-17 11:13:45,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:45,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:45,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 11:13:45,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 11:13:45,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:45,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:45,177 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-17 11:13:45,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:45,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833008281] [2025-03-17 11:13:45,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833008281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:45,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:45,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:45,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109833057] [2025-03-17 11:13:45,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:45,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:45,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:45,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:45,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:45,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 688 [2025-03-17 11:13:45,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 500 transitions, 1027 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 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-17 11:13:45,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:45,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 688 [2025-03-17 11:13:45,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:45,404 INFO L124 PetriNetUnfolderBase]: 161/897 cut-off events. [2025-03-17 11:13:45,404 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-17 11:13:45,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 897 events. 161/897 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2211 event pairs, 3 based on Foata normal form. 0/745 useless extension candidates. Maximal degree in co-relation 1042. Up to 105 conditions per place. [2025-03-17 11:13:45,415 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 43 selfloop transitions, 2 changer transitions 0/518 dead transitions. [2025-03-17 11:13:45,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 518 transitions, 1169 flow [2025-03-17 11:13:45,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1576 transitions. [2025-03-17 11:13:45,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7635658914728682 [2025-03-17 11:13:45,420 INFO L175 Difference]: Start difference. First operand has 487 places, 500 transitions, 1027 flow. Second operand 3 states and 1576 transitions. [2025-03-17 11:13:45,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 518 transitions, 1169 flow [2025-03-17 11:13:45,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 518 transitions, 1165 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:45,427 INFO L231 Difference]: Finished difference. Result has 487 places, 500 transitions, 1031 flow [2025-03-17 11:13:45,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1031, PETRI_PLACES=487, PETRI_TRANSITIONS=500} [2025-03-17 11:13:45,429 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -161 predicate places. [2025-03-17 11:13:45,429 INFO L471 AbstractCegarLoop]: Abstraction has has 487 places, 500 transitions, 1031 flow [2025-03-17 11:13:45,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 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-17 11:13:45,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:45,430 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] [2025-03-17 11:13:45,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:13:45,430 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:45,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:45,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1522102448, now seen corresponding path program 1 times [2025-03-17 11:13:45,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:45,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939051751] [2025-03-17 11:13:45,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:45,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:45,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 11:13:45,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 11:13:45,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:45,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:45,475 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-17 11:13:45,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:45,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939051751] [2025-03-17 11:13:45,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939051751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:45,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:45,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:45,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995619281] [2025-03-17 11:13:45,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:45,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:45,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:45,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:45,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:45,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 688 [2025-03-17 11:13:45,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 500 transitions, 1031 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:13:45,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:45,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 688 [2025-03-17 11:13:45,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:45,665 INFO L124 PetriNetUnfolderBase]: 155/788 cut-off events. [2025-03-17 11:13:45,665 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-03-17 11:13:45,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 788 events. 155/788 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1702 event pairs, 10 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 957. Up to 171 conditions per place. [2025-03-17 11:13:45,674 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 27 selfloop transitions, 2 changer transitions 0/499 dead transitions. [2025-03-17 11:13:45,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 499 transitions, 1087 flow [2025-03-17 11:13:45,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:45,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-03-17 11:13:45,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752422480620155 [2025-03-17 11:13:45,677 INFO L175 Difference]: Start difference. First operand has 487 places, 500 transitions, 1031 flow. Second operand 3 states and 1553 transitions. [2025-03-17 11:13:45,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 499 transitions, 1087 flow [2025-03-17 11:13:45,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 499 transitions, 1085 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:45,684 INFO L231 Difference]: Finished difference. Result has 487 places, 499 transitions, 1031 flow [2025-03-17 11:13:45,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1031, PETRI_PLACES=487, PETRI_TRANSITIONS=499} [2025-03-17 11:13:45,685 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -161 predicate places. [2025-03-17 11:13:45,685 INFO L471 AbstractCegarLoop]: Abstraction has has 487 places, 499 transitions, 1031 flow [2025-03-17 11:13:45,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:13:45,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:45,687 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] [2025-03-17 11:13:45,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:13:45,687 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:45,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:45,688 INFO L85 PathProgramCache]: Analyzing trace with hash -630031540, now seen corresponding path program 1 times [2025-03-17 11:13:45,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:45,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107007017] [2025-03-17 11:13:45,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:45,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:45,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 11:13:45,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 11:13:45,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:45,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:45,719 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-17 11:13:45,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:45,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107007017] [2025-03-17 11:13:45,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107007017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:45,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:45,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:45,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296210754] [2025-03-17 11:13:45,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:45,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:45,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:45,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:45,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:45,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 688 [2025-03-17 11:13:45,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 499 transitions, 1031 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:13:45,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:45,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 688 [2025-03-17 11:13:45,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:45,864 INFO L124 PetriNetUnfolderBase]: 155/787 cut-off events. [2025-03-17 11:13:45,864 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-17 11:13:45,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 787 events. 155/787 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1694 event pairs, 10 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 951. Up to 172 conditions per place. [2025-03-17 11:13:45,873 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 28 selfloop transitions, 2 changer transitions 0/498 dead transitions. [2025-03-17 11:13:45,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 498 transitions, 1089 flow [2025-03-17 11:13:45,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:45,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:45,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-03-17 11:13:45,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751453488372093 [2025-03-17 11:13:45,876 INFO L175 Difference]: Start difference. First operand has 487 places, 499 transitions, 1031 flow. Second operand 3 states and 1551 transitions. [2025-03-17 11:13:45,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 498 transitions, 1089 flow [2025-03-17 11:13:45,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 498 transitions, 1085 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:45,883 INFO L231 Difference]: Finished difference. Result has 486 places, 498 transitions, 1029 flow [2025-03-17 11:13:45,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1029, PETRI_PLACES=486, PETRI_TRANSITIONS=498} [2025-03-17 11:13:45,884 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -162 predicate places. [2025-03-17 11:13:45,884 INFO L471 AbstractCegarLoop]: Abstraction has has 486 places, 498 transitions, 1029 flow [2025-03-17 11:13:45,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:13:45,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:45,887 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] [2025-03-17 11:13:45,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:13:45,887 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:45,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:45,888 INFO L85 PathProgramCache]: Analyzing trace with hash 540396241, now seen corresponding path program 1 times [2025-03-17 11:13:45,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:45,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882340137] [2025-03-17 11:13:45,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:45,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:45,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 11:13:45,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 11:13:45,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:45,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:45,926 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-17 11:13:45,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:45,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882340137] [2025-03-17 11:13:45,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882340137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:45,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:45,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:45,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244821182] [2025-03-17 11:13:45,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:45,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:45,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:45,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:45,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:45,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 688 [2025-03-17 11:13:45,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 498 transitions, 1029 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 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-17 11:13:45,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:45,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 688 [2025-03-17 11:13:45,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:46,067 INFO L124 PetriNetUnfolderBase]: 155/786 cut-off events. [2025-03-17 11:13:46,067 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-03-17 11:13:46,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 786 events. 155/786 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1714 event pairs, 10 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 948. Up to 169 conditions per place. [2025-03-17 11:13:46,074 INFO L140 encePairwiseOnDemand]: 686/688 looper letters, 26 selfloop transitions, 1 changer transitions 0/497 dead transitions. [2025-03-17 11:13:46,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 497 transitions, 1081 flow [2025-03-17 11:13:46,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:46,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:46,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1560 transitions. [2025-03-17 11:13:46,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7558139534883721 [2025-03-17 11:13:46,077 INFO L175 Difference]: Start difference. First operand has 486 places, 498 transitions, 1029 flow. Second operand 3 states and 1560 transitions. [2025-03-17 11:13:46,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 497 transitions, 1081 flow [2025-03-17 11:13:46,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 497 transitions, 1077 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:46,082 INFO L231 Difference]: Finished difference. Result has 485 places, 497 transitions, 1025 flow [2025-03-17 11:13:46,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=483, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1025, PETRI_PLACES=485, PETRI_TRANSITIONS=497} [2025-03-17 11:13:46,083 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -163 predicate places. [2025-03-17 11:13:46,084 INFO L471 AbstractCegarLoop]: Abstraction has has 485 places, 497 transitions, 1025 flow [2025-03-17 11:13:46,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 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-17 11:13:46,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:46,085 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] [2025-03-17 11:13:46,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:13:46,085 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:46,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:46,085 INFO L85 PathProgramCache]: Analyzing trace with hash 738983426, now seen corresponding path program 1 times [2025-03-17 11:13:46,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:46,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694869208] [2025-03-17 11:13:46,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:46,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:46,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 11:13:46,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 11:13:46,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:46,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:46,122 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-17 11:13:46,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:46,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694869208] [2025-03-17 11:13:46,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694869208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:46,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:46,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:46,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296155567] [2025-03-17 11:13:46,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:46,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:46,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:46,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:46,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:46,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 688 [2025-03-17 11:13:46,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 497 transitions, 1025 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:13:46,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:46,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 688 [2025-03-17 11:13:46,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:46,279 INFO L124 PetriNetUnfolderBase]: 155/785 cut-off events. [2025-03-17 11:13:46,279 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-17 11:13:46,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 785 events. 155/785 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1705 event pairs, 10 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 947. Up to 171 conditions per place. [2025-03-17 11:13:46,287 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 27 selfloop transitions, 2 changer transitions 0/496 dead transitions. [2025-03-17 11:13:46,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 496 transitions, 1081 flow [2025-03-17 11:13:46,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:46,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-03-17 11:13:46,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752422480620155 [2025-03-17 11:13:46,290 INFO L175 Difference]: Start difference. First operand has 485 places, 497 transitions, 1025 flow. Second operand 3 states and 1553 transitions. [2025-03-17 11:13:46,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 496 transitions, 1081 flow [2025-03-17 11:13:46,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 496 transitions, 1080 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:46,296 INFO L231 Difference]: Finished difference. Result has 485 places, 496 transitions, 1026 flow [2025-03-17 11:13:46,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=483, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1026, PETRI_PLACES=485, PETRI_TRANSITIONS=496} [2025-03-17 11:13:46,297 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -163 predicate places. [2025-03-17 11:13:46,297 INFO L471 AbstractCegarLoop]: Abstraction has has 485 places, 496 transitions, 1026 flow [2025-03-17 11:13:46,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:13:46,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:46,298 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] [2025-03-17 11:13:46,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:13:46,298 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:46,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:46,299 INFO L85 PathProgramCache]: Analyzing trace with hash -891078288, now seen corresponding path program 1 times [2025-03-17 11:13:46,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:46,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680320437] [2025-03-17 11:13:46,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:46,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:46,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 11:13:46,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 11:13:46,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:46,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:46,337 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-17 11:13:46,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:46,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680320437] [2025-03-17 11:13:46,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680320437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:46,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:46,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:46,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842004802] [2025-03-17 11:13:46,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:46,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:46,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:46,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:46,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:46,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 688 [2025-03-17 11:13:46,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 496 transitions, 1026 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:13:46,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:46,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 688 [2025-03-17 11:13:46,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:46,478 INFO L124 PetriNetUnfolderBase]: 155/784 cut-off events. [2025-03-17 11:13:46,478 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-17 11:13:46,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 784 events. 155/784 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1721 event pairs, 10 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 949. Up to 172 conditions per place. [2025-03-17 11:13:46,486 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 28 selfloop transitions, 2 changer transitions 0/495 dead transitions. [2025-03-17 11:13:46,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 495 transitions, 1084 flow [2025-03-17 11:13:46,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-03-17 11:13:46,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751453488372093 [2025-03-17 11:13:46,489 INFO L175 Difference]: Start difference. First operand has 485 places, 496 transitions, 1026 flow. Second operand 3 states and 1551 transitions. [2025-03-17 11:13:46,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 495 transitions, 1084 flow [2025-03-17 11:13:46,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 484 places, 495 transitions, 1080 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:46,514 INFO L231 Difference]: Finished difference. Result has 484 places, 495 transitions, 1024 flow [2025-03-17 11:13:46,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1024, PETRI_PLACES=484, PETRI_TRANSITIONS=495} [2025-03-17 11:13:46,515 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -164 predicate places. [2025-03-17 11:13:46,515 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 495 transitions, 1024 flow [2025-03-17 11:13:46,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:13:46,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:46,518 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] [2025-03-17 11:13:46,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:13:46,519 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:46,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:46,520 INFO L85 PathProgramCache]: Analyzing trace with hash -820241022, now seen corresponding path program 1 times [2025-03-17 11:13:46,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:46,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442522343] [2025-03-17 11:13:46,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:46,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:46,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 11:13:46,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 11:13:46,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:46,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:46,567 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-17 11:13:46,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:46,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442522343] [2025-03-17 11:13:46,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442522343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:46,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:46,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:46,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22956723] [2025-03-17 11:13:46,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:46,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:46,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:46,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:46,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:46,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 688 [2025-03-17 11:13:46,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 495 transitions, 1024 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 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-17 11:13:46,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:46,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 688 [2025-03-17 11:13:46,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:46,782 INFO L124 PetriNetUnfolderBase]: 295/1159 cut-off events. [2025-03-17 11:13:46,782 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2025-03-17 11:13:46,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1589 conditions, 1159 events. 295/1159 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3798 event pairs, 10 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1518. Up to 166 conditions per place. [2025-03-17 11:13:46,797 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 47 selfloop transitions, 2 changer transitions 0/516 dead transitions. [2025-03-17 11:13:46,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 516 transitions, 1186 flow [2025-03-17 11:13:46,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:46,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:46,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1578 transitions. [2025-03-17 11:13:46,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7645348837209303 [2025-03-17 11:13:46,801 INFO L175 Difference]: Start difference. First operand has 484 places, 495 transitions, 1024 flow. Second operand 3 states and 1578 transitions. [2025-03-17 11:13:46,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 516 transitions, 1186 flow [2025-03-17 11:13:46,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 516 transitions, 1182 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:46,807 INFO L231 Difference]: Finished difference. Result has 484 places, 495 transitions, 1028 flow [2025-03-17 11:13:46,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1028, PETRI_PLACES=484, PETRI_TRANSITIONS=495} [2025-03-17 11:13:46,808 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -164 predicate places. [2025-03-17 11:13:46,808 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 495 transitions, 1028 flow [2025-03-17 11:13:46,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 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-17 11:13:46,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:46,810 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] [2025-03-17 11:13:46,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:13:46,810 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:46,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:46,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2042317339, now seen corresponding path program 1 times [2025-03-17 11:13:46,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:46,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465426567] [2025-03-17 11:13:46,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:46,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:46,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 11:13:46,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 11:13:46,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:46,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:46,849 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-17 11:13:46,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:46,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465426567] [2025-03-17 11:13:46,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465426567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:46,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:46,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:46,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630317131] [2025-03-17 11:13:46,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:46,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:46,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:46,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:46,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:46,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 688 [2025-03-17 11:13:46,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 495 transitions, 1028 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:13:46,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:46,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 688 [2025-03-17 11:13:46,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:47,072 INFO L124 PetriNetUnfolderBase]: 291/1100 cut-off events. [2025-03-17 11:13:47,072 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-03-17 11:13:47,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 1100 events. 291/1100 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3454 event pairs, 30 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1495. Up to 323 conditions per place. [2025-03-17 11:13:47,084 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 28 selfloop transitions, 2 changer transitions 0/494 dead transitions. [2025-03-17 11:13:47,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 494 transitions, 1086 flow [2025-03-17 11:13:47,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:47,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-03-17 11:13:47,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752422480620155 [2025-03-17 11:13:47,088 INFO L175 Difference]: Start difference. First operand has 484 places, 495 transitions, 1028 flow. Second operand 3 states and 1553 transitions. [2025-03-17 11:13:47,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 494 transitions, 1086 flow [2025-03-17 11:13:47,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 484 places, 494 transitions, 1084 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:47,094 INFO L231 Difference]: Finished difference. Result has 484 places, 494 transitions, 1028 flow [2025-03-17 11:13:47,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1028, PETRI_PLACES=484, PETRI_TRANSITIONS=494} [2025-03-17 11:13:47,095 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -164 predicate places. [2025-03-17 11:13:47,095 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 494 transitions, 1028 flow [2025-03-17 11:13:47,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:13:47,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:47,096 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] [2025-03-17 11:13:47,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:13:47,096 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:47,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:47,096 INFO L85 PathProgramCache]: Analyzing trace with hash 980405513, now seen corresponding path program 1 times [2025-03-17 11:13:47,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:47,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445662668] [2025-03-17 11:13:47,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:47,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:47,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 11:13:47,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 11:13:47,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:47,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:47,139 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-17 11:13:47,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:47,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445662668] [2025-03-17 11:13:47,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445662668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:47,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:47,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:47,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558708388] [2025-03-17 11:13:47,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:47,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:47,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:47,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:47,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:47,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 688 [2025-03-17 11:13:47,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 494 transitions, 1028 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:13:47,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:47,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 688 [2025-03-17 11:13:47,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:47,342 INFO L124 PetriNetUnfolderBase]: 291/1099 cut-off events. [2025-03-17 11:13:47,343 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-03-17 11:13:47,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 1099 events. 291/1099 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3445 event pairs, 30 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1485. Up to 324 conditions per place. [2025-03-17 11:13:47,357 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 29 selfloop transitions, 2 changer transitions 0/493 dead transitions. [2025-03-17 11:13:47,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 493 transitions, 1088 flow [2025-03-17 11:13:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:47,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-03-17 11:13:47,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751453488372093 [2025-03-17 11:13:47,360 INFO L175 Difference]: Start difference. First operand has 484 places, 494 transitions, 1028 flow. Second operand 3 states and 1551 transitions. [2025-03-17 11:13:47,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 493 transitions, 1088 flow [2025-03-17 11:13:47,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 493 transitions, 1084 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:47,366 INFO L231 Difference]: Finished difference. Result has 483 places, 493 transitions, 1026 flow [2025-03-17 11:13:47,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1026, PETRI_PLACES=483, PETRI_TRANSITIONS=493} [2025-03-17 11:13:47,367 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -165 predicate places. [2025-03-17 11:13:47,367 INFO L471 AbstractCegarLoop]: Abstraction has has 483 places, 493 transitions, 1026 flow [2025-03-17 11:13:47,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:13:47,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:47,368 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] [2025-03-17 11:13:47,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:13:47,368 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:47,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:47,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1190833850, now seen corresponding path program 1 times [2025-03-17 11:13:47,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:47,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136350983] [2025-03-17 11:13:47,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:47,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:47,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-17 11:13:47,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-17 11:13:47,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:47,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:47,409 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-17 11:13:47,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:47,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136350983] [2025-03-17 11:13:47,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136350983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:47,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:47,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:47,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908330103] [2025-03-17 11:13:47,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:47,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:47,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:47,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:47,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:47,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 688 [2025-03-17 11:13:47,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 493 transitions, 1026 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 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-17 11:13:47,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:47,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 688 [2025-03-17 11:13:47,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:47,639 INFO L124 PetriNetUnfolderBase]: 291/1098 cut-off events. [2025-03-17 11:13:47,639 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-03-17 11:13:47,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1554 conditions, 1098 events. 291/1098 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3438 event pairs, 30 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1482. Up to 321 conditions per place. [2025-03-17 11:13:47,654 INFO L140 encePairwiseOnDemand]: 686/688 looper letters, 27 selfloop transitions, 1 changer transitions 0/492 dead transitions. [2025-03-17 11:13:47,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 492 transitions, 1080 flow [2025-03-17 11:13:47,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1560 transitions. [2025-03-17 11:13:47,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7558139534883721 [2025-03-17 11:13:47,658 INFO L175 Difference]: Start difference. First operand has 483 places, 493 transitions, 1026 flow. Second operand 3 states and 1560 transitions. [2025-03-17 11:13:47,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 492 transitions, 1080 flow [2025-03-17 11:13:47,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 492 transitions, 1076 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:47,665 INFO L231 Difference]: Finished difference. Result has 482 places, 492 transitions, 1022 flow [2025-03-17 11:13:47,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1022, PETRI_PLACES=482, PETRI_TRANSITIONS=492} [2025-03-17 11:13:47,666 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -166 predicate places. [2025-03-17 11:13:47,666 INFO L471 AbstractCegarLoop]: Abstraction has has 482 places, 492 transitions, 1022 flow [2025-03-17 11:13:47,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 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-17 11:13:47,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:47,667 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] [2025-03-17 11:13:47,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:13:47,667 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:47,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:47,668 INFO L85 PathProgramCache]: Analyzing trace with hash -344867450, now seen corresponding path program 1 times [2025-03-17 11:13:47,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:47,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994149010] [2025-03-17 11:13:47,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:47,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:47,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-17 11:13:47,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-17 11:13:47,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:47,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:47,728 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-17 11:13:47,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:47,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994149010] [2025-03-17 11:13:47,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994149010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:47,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:47,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:47,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426127687] [2025-03-17 11:13:47,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:47,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:47,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:47,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:47,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:47,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 688 [2025-03-17 11:13:47,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 492 transitions, 1022 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:13:47,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:47,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 688 [2025-03-17 11:13:47,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:47,927 INFO L124 PetriNetUnfolderBase]: 291/1097 cut-off events. [2025-03-17 11:13:47,927 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-03-17 11:13:47,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1554 conditions, 1097 events. 291/1097 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3448 event pairs, 30 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1481. Up to 323 conditions per place. [2025-03-17 11:13:47,941 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 28 selfloop transitions, 2 changer transitions 0/491 dead transitions. [2025-03-17 11:13:47,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 491 transitions, 1080 flow [2025-03-17 11:13:47,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:47,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:47,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-03-17 11:13:47,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752422480620155 [2025-03-17 11:13:47,944 INFO L175 Difference]: Start difference. First operand has 482 places, 492 transitions, 1022 flow. Second operand 3 states and 1553 transitions. [2025-03-17 11:13:47,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 491 transitions, 1080 flow [2025-03-17 11:13:47,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 491 transitions, 1079 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:47,950 INFO L231 Difference]: Finished difference. Result has 482 places, 491 transitions, 1023 flow [2025-03-17 11:13:47,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1023, PETRI_PLACES=482, PETRI_TRANSITIONS=491} [2025-03-17 11:13:47,951 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -166 predicate places. [2025-03-17 11:13:47,951 INFO L471 AbstractCegarLoop]: Abstraction has has 482 places, 491 transitions, 1023 flow [2025-03-17 11:13:47,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:13:47,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:47,952 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] [2025-03-17 11:13:47,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:13:47,953 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:47,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:47,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1843759070, now seen corresponding path program 1 times [2025-03-17 11:13:47,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:47,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186426321] [2025-03-17 11:13:47,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:47,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:47,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-17 11:13:47,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-17 11:13:47,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:47,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:47,997 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-17 11:13:47,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:47,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186426321] [2025-03-17 11:13:47,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186426321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:47,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:47,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:47,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885239239] [2025-03-17 11:13:47,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:47,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:47,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:47,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:47,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:48,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 688 [2025-03-17 11:13:48,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 491 transitions, 1023 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:13:48,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:48,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 688 [2025-03-17 11:13:48,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:48,181 INFO L124 PetriNetUnfolderBase]: 291/1096 cut-off events. [2025-03-17 11:13:48,181 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-03-17 11:13:48,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1556 conditions, 1096 events. 291/1096 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3451 event pairs, 30 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1483. Up to 324 conditions per place. [2025-03-17 11:13:48,191 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 29 selfloop transitions, 2 changer transitions 0/490 dead transitions. [2025-03-17 11:13:48,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 490 transitions, 1083 flow [2025-03-17 11:13:48,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:48,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-03-17 11:13:48,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751453488372093 [2025-03-17 11:13:48,194 INFO L175 Difference]: Start difference. First operand has 482 places, 491 transitions, 1023 flow. Second operand 3 states and 1551 transitions. [2025-03-17 11:13:48,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 490 transitions, 1083 flow [2025-03-17 11:13:48,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 490 transitions, 1079 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:48,199 INFO L231 Difference]: Finished difference. Result has 481 places, 490 transitions, 1021 flow [2025-03-17 11:13:48,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1021, PETRI_PLACES=481, PETRI_TRANSITIONS=490} [2025-03-17 11:13:48,200 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -167 predicate places. [2025-03-17 11:13:48,200 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 490 transitions, 1021 flow [2025-03-17 11:13:48,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:13:48,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:48,202 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] [2025-03-17 11:13:48,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:13:48,202 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:48,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1936201259, now seen corresponding path program 1 times [2025-03-17 11:13:48,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:48,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937254170] [2025-03-17 11:13:48,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:48,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:48,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-17 11:13:48,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-17 11:13:48,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:48,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:48,253 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-17 11:13:48,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:48,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937254170] [2025-03-17 11:13:48,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937254170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:48,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:48,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:48,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61328478] [2025-03-17 11:13:48,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:48,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:48,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:48,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:48,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:48,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 688 [2025-03-17 11:13:48,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 490 transitions, 1021 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 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-17 11:13:48,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:48,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 688 [2025-03-17 11:13:48,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:48,618 INFO L124 PetriNetUnfolderBase]: 547/1955 cut-off events. [2025-03-17 11:13:48,618 INFO L125 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2025-03-17 11:13:48,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2772 conditions, 1955 events. 547/1955 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 9200 event pairs, 34 based on Foata normal form. 0/1623 useless extension candidates. Maximal degree in co-relation 2700. Up to 298 conditions per place. [2025-03-17 11:13:48,634 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 48 selfloop transitions, 2 changer transitions 0/511 dead transitions. [2025-03-17 11:13:48,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 511 transitions, 1188 flow [2025-03-17 11:13:48,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:48,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:48,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1577 transitions. [2025-03-17 11:13:48,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7640503875968992 [2025-03-17 11:13:48,638 INFO L175 Difference]: Start difference. First operand has 481 places, 490 transitions, 1021 flow. Second operand 3 states and 1577 transitions. [2025-03-17 11:13:48,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 511 transitions, 1188 flow [2025-03-17 11:13:48,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 511 transitions, 1184 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:48,642 INFO L231 Difference]: Finished difference. Result has 481 places, 490 transitions, 1025 flow [2025-03-17 11:13:48,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1025, PETRI_PLACES=481, PETRI_TRANSITIONS=490} [2025-03-17 11:13:48,644 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -167 predicate places. [2025-03-17 11:13:48,644 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 490 transitions, 1025 flow [2025-03-17 11:13:48,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 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-17 11:13:48,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:48,644 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] [2025-03-17 11:13:48,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:13:48,645 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:48,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:48,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1133750432, now seen corresponding path program 1 times [2025-03-17 11:13:48,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:48,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570709899] [2025-03-17 11:13:48,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:48,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:48,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-17 11:13:48,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-17 11:13:48,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:48,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:48,691 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-17 11:13:48,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:48,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570709899] [2025-03-17 11:13:48,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570709899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:48,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:48,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:48,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059259018] [2025-03-17 11:13:48,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:48,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:48,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:48,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:48,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:48,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 688 [2025-03-17 11:13:48,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 490 transitions, 1025 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:13:48,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:48,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 688 [2025-03-17 11:13:48,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:48,958 INFO L124 PetriNetUnfolderBase]: 527/1602 cut-off events. [2025-03-17 11:13:48,958 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-03-17 11:13:48,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2505 conditions, 1602 events. 527/1602 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6467 event pairs, 82 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 2431. Up to 591 conditions per place. [2025-03-17 11:13:48,982 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 29 selfloop transitions, 2 changer transitions 0/489 dead transitions. [2025-03-17 11:13:48,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 489 transitions, 1085 flow [2025-03-17 11:13:48,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-03-17 11:13:48,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752422480620155 [2025-03-17 11:13:48,985 INFO L175 Difference]: Start difference. First operand has 481 places, 490 transitions, 1025 flow. Second operand 3 states and 1553 transitions. [2025-03-17 11:13:48,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 489 transitions, 1085 flow [2025-03-17 11:13:48,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 489 transitions, 1083 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:48,991 INFO L231 Difference]: Finished difference. Result has 481 places, 489 transitions, 1025 flow [2025-03-17 11:13:48,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1025, PETRI_PLACES=481, PETRI_TRANSITIONS=489} [2025-03-17 11:13:48,991 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -167 predicate places. [2025-03-17 11:13:48,991 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 489 transitions, 1025 flow [2025-03-17 11:13:48,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:13:48,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:48,992 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] [2025-03-17 11:13:48,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:13:48,992 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:48,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:48,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1595972610, now seen corresponding path program 1 times [2025-03-17 11:13:48,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:48,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590046790] [2025-03-17 11:13:48,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:48,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:49,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-17 11:13:49,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-17 11:13:49,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:49,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:49,037 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-17 11:13:49,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:49,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590046790] [2025-03-17 11:13:49,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590046790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:49,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:49,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:49,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179650071] [2025-03-17 11:13:49,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:49,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:49,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:49,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:49,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:49,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 688 [2025-03-17 11:13:49,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 489 transitions, 1025 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:13:49,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:49,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 688 [2025-03-17 11:13:49,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:49,286 INFO L124 PetriNetUnfolderBase]: 527/1601 cut-off events. [2025-03-17 11:13:49,287 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2025-03-17 11:13:49,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2479 conditions, 1601 events. 527/1601 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6468 event pairs, 82 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 2405. Up to 592 conditions per place. [2025-03-17 11:13:49,308 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 30 selfloop transitions, 2 changer transitions 0/488 dead transitions. [2025-03-17 11:13:49,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 488 transitions, 1087 flow [2025-03-17 11:13:49,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:49,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-03-17 11:13:49,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751453488372093 [2025-03-17 11:13:49,310 INFO L175 Difference]: Start difference. First operand has 481 places, 489 transitions, 1025 flow. Second operand 3 states and 1551 transitions. [2025-03-17 11:13:49,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 488 transitions, 1087 flow [2025-03-17 11:13:49,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 488 transitions, 1083 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:49,315 INFO L231 Difference]: Finished difference. Result has 480 places, 488 transitions, 1023 flow [2025-03-17 11:13:49,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1023, PETRI_PLACES=480, PETRI_TRANSITIONS=488} [2025-03-17 11:13:49,317 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -168 predicate places. [2025-03-17 11:13:49,317 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 488 transitions, 1023 flow [2025-03-17 11:13:49,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:13:49,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:49,317 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] [2025-03-17 11:13:49,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:13:49,317 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:49,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:49,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1630555720, now seen corresponding path program 1 times [2025-03-17 11:13:49,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:49,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595118321] [2025-03-17 11:13:49,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:49,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:49,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-17 11:13:49,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-17 11:13:49,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:49,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:49,363 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-17 11:13:49,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:49,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595118321] [2025-03-17 11:13:49,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595118321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:49,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:49,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:49,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056954232] [2025-03-17 11:13:49,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:49,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:49,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:49,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:49,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:49,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 688 [2025-03-17 11:13:49,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 488 transitions, 1023 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 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-17 11:13:49,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:49,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 688 [2025-03-17 11:13:49,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:49,686 INFO L124 PetriNetUnfolderBase]: 527/1600 cut-off events. [2025-03-17 11:13:49,686 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-03-17 11:13:49,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 1600 events. 527/1600 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6436 event pairs, 82 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 2402. Up to 589 conditions per place. [2025-03-17 11:13:49,707 INFO L140 encePairwiseOnDemand]: 686/688 looper letters, 28 selfloop transitions, 1 changer transitions 0/487 dead transitions. [2025-03-17 11:13:49,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 487 transitions, 1079 flow [2025-03-17 11:13:49,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1560 transitions. [2025-03-17 11:13:49,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7558139534883721 [2025-03-17 11:13:49,711 INFO L175 Difference]: Start difference. First operand has 480 places, 488 transitions, 1023 flow. Second operand 3 states and 1560 transitions. [2025-03-17 11:13:49,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 487 transitions, 1079 flow [2025-03-17 11:13:49,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 487 transitions, 1075 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:49,717 INFO L231 Difference]: Finished difference. Result has 479 places, 487 transitions, 1019 flow [2025-03-17 11:13:49,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1019, PETRI_PLACES=479, PETRI_TRANSITIONS=487} [2025-03-17 11:13:49,718 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -169 predicate places. [2025-03-17 11:13:49,718 INFO L471 AbstractCegarLoop]: Abstraction has has 479 places, 487 transitions, 1019 flow [2025-03-17 11:13:49,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 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-17 11:13:49,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:49,719 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, 1, 1, 1, 1] [2025-03-17 11:13:49,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:13:49,719 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:49,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:49,720 INFO L85 PathProgramCache]: Analyzing trace with hash -947965951, now seen corresponding path program 1 times [2025-03-17 11:13:49,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:49,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142039650] [2025-03-17 11:13:49,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:49,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:49,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 11:13:49,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 11:13:49,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:49,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:49,786 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-17 11:13:49,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:49,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142039650] [2025-03-17 11:13:49,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142039650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:49,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:49,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:49,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145497615] [2025-03-17 11:13:49,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:49,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:49,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:49,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:49,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:49,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 688 [2025-03-17 11:13:49,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 487 transitions, 1019 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:13:49,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:49,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 688 [2025-03-17 11:13:49,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:50,046 INFO L124 PetriNetUnfolderBase]: 527/1599 cut-off events. [2025-03-17 11:13:50,047 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2025-03-17 11:13:50,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 1599 events. 527/1599 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6433 event pairs, 82 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 2401. Up to 591 conditions per place. [2025-03-17 11:13:50,069 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 29 selfloop transitions, 2 changer transitions 0/486 dead transitions. [2025-03-17 11:13:50,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 486 transitions, 1079 flow [2025-03-17 11:13:50,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-03-17 11:13:50,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752422480620155 [2025-03-17 11:13:50,071 INFO L175 Difference]: Start difference. First operand has 479 places, 487 transitions, 1019 flow. Second operand 3 states and 1553 transitions. [2025-03-17 11:13:50,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 486 transitions, 1079 flow [2025-03-17 11:13:50,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 486 transitions, 1078 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:50,077 INFO L231 Difference]: Finished difference. Result has 479 places, 486 transitions, 1020 flow [2025-03-17 11:13:50,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1020, PETRI_PLACES=479, PETRI_TRANSITIONS=486} [2025-03-17 11:13:50,078 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -169 predicate places. [2025-03-17 11:13:50,078 INFO L471 AbstractCegarLoop]: Abstraction has has 479 places, 486 transitions, 1020 flow [2025-03-17 11:13:50,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:13:50,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:50,079 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:50,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:13:50,079 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:50,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:50,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1610287004, now seen corresponding path program 1 times [2025-03-17 11:13:50,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:50,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006644691] [2025-03-17 11:13:50,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:50,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:50,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-17 11:13:50,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-17 11:13:50,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:50,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:50,125 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-17 11:13:50,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:50,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006644691] [2025-03-17 11:13:50,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006644691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:50,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:50,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:50,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248160707] [2025-03-17 11:13:50,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:50,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:50,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:50,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:50,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:50,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 688 [2025-03-17 11:13:50,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 486 transitions, 1020 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:13:50,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:50,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 688 [2025-03-17 11:13:50,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:50,367 INFO L124 PetriNetUnfolderBase]: 527/1598 cut-off events. [2025-03-17 11:13:50,367 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2025-03-17 11:13:50,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2476 conditions, 1598 events. 527/1598 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6438 event pairs, 82 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 2402. Up to 591 conditions per place. [2025-03-17 11:13:50,388 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 29 selfloop transitions, 2 changer transitions 0/485 dead transitions. [2025-03-17 11:13:50,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 485 transitions, 1080 flow [2025-03-17 11:13:50,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:50,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-03-17 11:13:50,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752422480620155 [2025-03-17 11:13:50,390 INFO L175 Difference]: Start difference. First operand has 479 places, 486 transitions, 1020 flow. Second operand 3 states and 1553 transitions. [2025-03-17 11:13:50,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 485 transitions, 1080 flow [2025-03-17 11:13:50,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 485 transitions, 1076 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:50,395 INFO L231 Difference]: Finished difference. Result has 478 places, 485 transitions, 1018 flow [2025-03-17 11:13:50,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1018, PETRI_PLACES=478, PETRI_TRANSITIONS=485} [2025-03-17 11:13:50,396 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -170 predicate places. [2025-03-17 11:13:50,396 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 485 transitions, 1018 flow [2025-03-17 11:13:50,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:13:50,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:50,397 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:50,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:13:50,397 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:50,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:50,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1067932082, now seen corresponding path program 1 times [2025-03-17 11:13:50,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:50,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997469213] [2025-03-17 11:13:50,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:50,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:50,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-17 11:13:50,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-17 11:13:50,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:50,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:50,443 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-17 11:13:50,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:50,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997469213] [2025-03-17 11:13:50,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997469213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:50,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:50,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:50,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147314515] [2025-03-17 11:13:50,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:50,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:50,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:50,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:50,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:50,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 688 [2025-03-17 11:13:50,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 485 transitions, 1018 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:13:50,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:50,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 688 [2025-03-17 11:13:50,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:50,741 INFO L124 PetriNetUnfolderBase]: 527/1597 cut-off events. [2025-03-17 11:13:50,741 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2025-03-17 11:13:50,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 1597 events. 527/1597 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6437 event pairs, 82 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 2401. Up to 591 conditions per place. [2025-03-17 11:13:50,757 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 29 selfloop transitions, 2 changer transitions 0/484 dead transitions. [2025-03-17 11:13:50,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 484 transitions, 1078 flow [2025-03-17 11:13:50,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:50,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:50,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-03-17 11:13:50,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752422480620155 [2025-03-17 11:13:50,760 INFO L175 Difference]: Start difference. First operand has 478 places, 485 transitions, 1018 flow. Second operand 3 states and 1553 transitions. [2025-03-17 11:13:50,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 484 transitions, 1078 flow [2025-03-17 11:13:50,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 484 transitions, 1074 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:50,765 INFO L231 Difference]: Finished difference. Result has 477 places, 484 transitions, 1016 flow [2025-03-17 11:13:50,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1016, PETRI_PLACES=477, PETRI_TRANSITIONS=484} [2025-03-17 11:13:50,769 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -171 predicate places. [2025-03-17 11:13:50,769 INFO L471 AbstractCegarLoop]: Abstraction has has 477 places, 484 transitions, 1016 flow [2025-03-17 11:13:50,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:13:50,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:50,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:13:50,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:13:50,770 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err74ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:50,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:50,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1854105412, now seen corresponding path program 1 times [2025-03-17 11:13:50,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:50,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859885860] [2025-03-17 11:13:50,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:50,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:50,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-17 11:13:50,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-17 11:13:50,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:50,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:50,826 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-17 11:13:50,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:50,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859885860] [2025-03-17 11:13:50,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859885860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:50,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:50,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:50,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137187799] [2025-03-17 11:13:50,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:50,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:50,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:50,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:50,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:50,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 688 [2025-03-17 11:13:50,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 484 transitions, 1016 flow. Second operand has 3 states, 3 states have (on average 499.0) internal successors, (1497), 3 states have internal predecessors, (1497), 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-17 11:13:50,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:50,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 688 [2025-03-17 11:13:50,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:51,747 INFO L124 PetriNetUnfolderBase]: 2621/5979 cut-off events. [2025-03-17 11:13:51,748 INFO L125 PetriNetUnfolderBase]: For 1198/1198 co-relation queries the response was YES. [2025-03-17 11:13:51,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10378 conditions, 5979 events. 2621/5979 cut-off events. For 1198/1198 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 41628 event pairs, 458 based on Foata normal form. 0/5024 useless extension candidates. Maximal degree in co-relation 10305. Up to 2446 conditions per place. [2025-03-17 11:13:51,814 INFO L140 encePairwiseOnDemand]: 675/688 looper letters, 45 selfloop transitions, 10 changer transitions 0/495 dead transitions. [2025-03-17 11:13:51,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 495 transitions, 1167 flow [2025-03-17 11:13:51,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:51,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:51,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1546 transitions. [2025-03-17 11:13:51,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.749031007751938 [2025-03-17 11:13:51,818 INFO L175 Difference]: Start difference. First operand has 477 places, 484 transitions, 1016 flow. Second operand 3 states and 1546 transitions. [2025-03-17 11:13:51,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 495 transitions, 1167 flow [2025-03-17 11:13:51,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 495 transitions, 1163 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:51,824 INFO L231 Difference]: Finished difference. Result has 472 places, 479 transitions, 1034 flow [2025-03-17 11:13:51,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1034, PETRI_PLACES=472, PETRI_TRANSITIONS=479} [2025-03-17 11:13:51,826 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -176 predicate places. [2025-03-17 11:13:51,827 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 479 transitions, 1034 flow [2025-03-17 11:13:51,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 499.0) internal successors, (1497), 3 states have internal predecessors, (1497), 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-17 11:13:51,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:51,828 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:13:51,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 11:13:51,828 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:51,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:51,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1249603307, now seen corresponding path program 1 times [2025-03-17 11:13:51,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:51,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244228451] [2025-03-17 11:13:51,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:51,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:51,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-17 11:13:51,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-17 11:13:51,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:51,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:51,883 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-17 11:13:51,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:51,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244228451] [2025-03-17 11:13:51,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244228451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:51,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:51,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:51,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099253600] [2025-03-17 11:13:51,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:51,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:51,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:51,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:51,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:51,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 510 out of 688 [2025-03-17 11:13:51,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 479 transitions, 1034 flow. Second operand has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 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-17 11:13:51,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:51,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 510 of 688 [2025-03-17 11:13:51,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:53,026 INFO L124 PetriNetUnfolderBase]: 2649/5021 cut-off events. [2025-03-17 11:13:53,026 INFO L125 PetriNetUnfolderBase]: For 4812/4926 co-relation queries the response was YES. [2025-03-17 11:13:53,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10266 conditions, 5021 events. 2649/5021 cut-off events. For 4812/4926 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 27126 event pairs, 130 based on Foata normal form. 0/4403 useless extension candidates. Maximal degree in co-relation 10193. Up to 2268 conditions per place. [2025-03-17 11:13:53,105 INFO L140 encePairwiseOnDemand]: 683/688 looper letters, 48 selfloop transitions, 4 changer transitions 0/499 dead transitions. [2025-03-17 11:13:53,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 499 transitions, 1231 flow [2025-03-17 11:13:53,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:53,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1573 transitions. [2025-03-17 11:13:53,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7621124031007752 [2025-03-17 11:13:53,108 INFO L175 Difference]: Start difference. First operand has 472 places, 479 transitions, 1034 flow. Second operand 3 states and 1573 transitions. [2025-03-17 11:13:53,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 499 transitions, 1231 flow [2025-03-17 11:13:53,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 499 transitions, 1212 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:53,117 INFO L231 Difference]: Finished difference. Result has 472 places, 478 transitions, 1036 flow [2025-03-17 11:13:53,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1036, PETRI_PLACES=472, PETRI_TRANSITIONS=478} [2025-03-17 11:13:53,117 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -176 predicate places. [2025-03-17 11:13:53,117 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 478 transitions, 1036 flow [2025-03-17 11:13:53,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 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-17 11:13:53,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:53,118 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:13:53,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 11:13:53,118 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:53,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:53,119 INFO L85 PathProgramCache]: Analyzing trace with hash -903022670, now seen corresponding path program 1 times [2025-03-17 11:13:53,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:53,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721027156] [2025-03-17 11:13:53,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:53,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:53,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-17 11:13:53,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-17 11:13:53,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:53,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:53,166 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-17 11:13:53,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:53,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721027156] [2025-03-17 11:13:53,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721027156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:53,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:53,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:53,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670839338] [2025-03-17 11:13:53,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:53,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:53,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:53,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:53,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:53,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 510 out of 688 [2025-03-17 11:13:53,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 478 transitions, 1036 flow. Second operand has 3 states, 3 states have (on average 511.6666666666667) internal successors, (1535), 3 states have internal predecessors, (1535), 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-17 11:13:53,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:53,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 510 of 688 [2025-03-17 11:13:53,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:54,511 INFO L124 PetriNetUnfolderBase]: 3622/9345 cut-off events. [2025-03-17 11:13:54,511 INFO L125 PetriNetUnfolderBase]: For 5429/5511 co-relation queries the response was YES. [2025-03-17 11:13:54,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16541 conditions, 9345 events. 3622/9345 cut-off events. For 5429/5511 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 75760 event pairs, 362 based on Foata normal form. 0/7776 useless extension candidates. Maximal degree in co-relation 16467. Up to 3192 conditions per place. [2025-03-17 11:13:54,615 INFO L140 encePairwiseOnDemand]: 683/688 looper letters, 47 selfloop transitions, 4 changer transitions 0/497 dead transitions. [2025-03-17 11:13:54,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 497 transitions, 1228 flow [2025-03-17 11:13:54,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1572 transitions. [2025-03-17 11:13:54,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7616279069767442 [2025-03-17 11:13:54,617 INFO L175 Difference]: Start difference. First operand has 472 places, 478 transitions, 1036 flow. Second operand 3 states and 1572 transitions. [2025-03-17 11:13:54,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 497 transitions, 1228 flow [2025-03-17 11:13:54,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 497 transitions, 1221 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:54,627 INFO L231 Difference]: Finished difference. Result has 472 places, 477 transitions, 1044 flow [2025-03-17 11:13:54,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1044, PETRI_PLACES=472, PETRI_TRANSITIONS=477} [2025-03-17 11:13:54,628 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -176 predicate places. [2025-03-17 11:13:54,628 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 477 transitions, 1044 flow [2025-03-17 11:13:54,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.6666666666667) internal successors, (1535), 3 states have internal predecessors, (1535), 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-17 11:13:54,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:54,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:13:54,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 11:13:54,629 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread4Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:54,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:54,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1612592958, now seen corresponding path program 1 times [2025-03-17 11:13:54,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:54,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238948171] [2025-03-17 11:13:54,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:54,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:54,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-17 11:13:54,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-17 11:13:54,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:54,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:54,676 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-17 11:13:54,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:54,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238948171] [2025-03-17 11:13:54,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238948171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:54,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:54,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:54,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835723411] [2025-03-17 11:13:54,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:54,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:54,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:54,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:54,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:54,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 510 out of 688 [2025-03-17 11:13:54,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 477 transitions, 1044 flow. Second operand has 3 states, 3 states have (on average 512.0) internal successors, (1536), 3 states have internal predecessors, (1536), 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-17 11:13:54,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:54,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 510 of 688 [2025-03-17 11:13:54,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:56,135 INFO L124 PetriNetUnfolderBase]: 3823/9663 cut-off events. [2025-03-17 11:13:56,135 INFO L125 PetriNetUnfolderBase]: For 8565/8635 co-relation queries the response was YES. [2025-03-17 11:13:56,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18552 conditions, 9663 events. 3823/9663 cut-off events. For 8565/8635 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 84309 event pairs, 210 based on Foata normal form. 0/8234 useless extension candidates. Maximal degree in co-relation 18477. Up to 3888 conditions per place. [2025-03-17 11:13:56,242 INFO L140 encePairwiseOnDemand]: 683/688 looper letters, 46 selfloop transitions, 4 changer transitions 0/495 dead transitions. [2025-03-17 11:13:56,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 495 transitions, 1237 flow [2025-03-17 11:13:56,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:56,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:56,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1571 transitions. [2025-03-17 11:13:56,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7611434108527132 [2025-03-17 11:13:56,244 INFO L175 Difference]: Start difference. First operand has 472 places, 477 transitions, 1044 flow. Second operand 3 states and 1571 transitions. [2025-03-17 11:13:56,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 495 transitions, 1237 flow [2025-03-17 11:13:56,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 495 transitions, 1230 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:56,253 INFO L231 Difference]: Finished difference. Result has 472 places, 476 transitions, 1052 flow [2025-03-17 11:13:56,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1052, PETRI_PLACES=472, PETRI_TRANSITIONS=476} [2025-03-17 11:13:56,254 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -176 predicate places. [2025-03-17 11:13:56,254 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 476 transitions, 1052 flow [2025-03-17 11:13:56,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 512.0) internal successors, (1536), 3 states have internal predecessors, (1536), 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-17 11:13:56,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:56,254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:13:56,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 11:13:56,254 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-17 11:13:56,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:56,255 INFO L85 PathProgramCache]: Analyzing trace with hash -676873322, now seen corresponding path program 1 times [2025-03-17 11:13:56,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:56,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343671895] [2025-03-17 11:13:56,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:56,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:56,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-17 11:13:56,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-17 11:13:56,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:56,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:56,335 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-17 11:13:56,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:56,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343671895] [2025-03-17 11:13:56,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343671895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:56,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:56,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:56,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34787452] [2025-03-17 11:13:56,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:56,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:56,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:56,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:56,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:56,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 688 [2025-03-17 11:13:56,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 476 transitions, 1052 flow. Second operand has 3 states, 3 states have (on average 515.6666666666666) internal successors, (1547), 3 states have internal predecessors, (1547), 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-17 11:13:56,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:56,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 688 [2025-03-17 11:13:56,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:57,151 INFO L124 PetriNetUnfolderBase]: 1053/3301 cut-off events. [2025-03-17 11:13:57,151 INFO L125 PetriNetUnfolderBase]: For 3308/3370 co-relation queries the response was YES. [2025-03-17 11:13:57,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6754 conditions, 3301 events. 1053/3301 cut-off events. For 3308/3370 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 21708 event pairs, 210 based on Foata normal form. 256/3051 useless extension candidates. Maximal degree in co-relation 6677. Up to 1517 conditions per place. [2025-03-17 11:13:57,187 INFO L140 encePairwiseOnDemand]: 686/688 looper letters, 0 selfloop transitions, 0 changer transitions 475/475 dead transitions. [2025-03-17 11:13:57,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 475 transitions, 1106 flow [2025-03-17 11:13:57,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:57,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1559 transitions. [2025-03-17 11:13:57,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7553294573643411 [2025-03-17 11:13:57,191 INFO L175 Difference]: Start difference. First operand has 472 places, 476 transitions, 1052 flow. Second operand 3 states and 1559 transitions. [2025-03-17 11:13:57,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 475 transitions, 1106 flow [2025-03-17 11:13:57,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 475 transitions, 1102 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:57,198 INFO L231 Difference]: Finished difference. Result has 472 places, 0 transitions, 0 flow [2025-03-17 11:13:57,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=472, PETRI_TRANSITIONS=0} [2025-03-17 11:13:57,198 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -176 predicate places. [2025-03-17 11:13:57,198 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 0 transitions, 0 flow [2025-03-17 11:13:57,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 515.6666666666666) internal successors, (1547), 3 states have internal predecessors, (1547), 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-17 11:13:57,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err74ASSERT_VIOLATIONDATA_RACE (335 of 336 remaining) [2025-03-17 11:13:57,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (334 of 336 remaining) [2025-03-17 11:13:57,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (333 of 336 remaining) [2025-03-17 11:13:57,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (332 of 336 remaining) [2025-03-17 11:13:57,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (331 of 336 remaining) [2025-03-17 11:13:57,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (330 of 336 remaining) [2025-03-17 11:13:57,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (329 of 336 remaining) [2025-03-17 11:13:57,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (328 of 336 remaining) [2025-03-17 11:13:57,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (327 of 336 remaining) [2025-03-17 11:13:57,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (326 of 336 remaining) [2025-03-17 11:13:57,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (325 of 336 remaining) [2025-03-17 11:13:57,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (324 of 336 remaining) [2025-03-17 11:13:57,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (323 of 336 remaining) [2025-03-17 11:13:57,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (322 of 336 remaining) [2025-03-17 11:13:57,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err73ASSERT_VIOLATIONDATA_RACE (321 of 336 remaining) [2025-03-17 11:13:57,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (320 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (319 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (318 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (317 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (316 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (315 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (314 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (313 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (312 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (311 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err72ASSERT_VIOLATIONDATA_RACE (310 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (309 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (308 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (307 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (306 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (305 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (304 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (303 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (302 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (301 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (300 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err71ASSERT_VIOLATIONDATA_RACE (299 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (298 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (297 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (296 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (295 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (294 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (293 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (292 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (291 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (290 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (289 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (288 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (287 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (286 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err70ASSERT_VIOLATIONDATA_RACE (285 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err58ASSERT_VIOLATIONDATA_RACE (284 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err57ASSERT_VIOLATIONDATA_RACE (283 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err56ASSERT_VIOLATIONDATA_RACE (282 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err55ASSERT_VIOLATIONDATA_RACE (281 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err54ASSERT_VIOLATIONDATA_RACE (280 of 336 remaining) [2025-03-17 11:13:57,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err53ASSERT_VIOLATIONDATA_RACE (279 of 336 remaining) [2025-03-17 11:13:57,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err52ASSERT_VIOLATIONDATA_RACE (278 of 336 remaining) [2025-03-17 11:13:57,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err51ASSERT_VIOLATIONDATA_RACE (277 of 336 remaining) [2025-03-17 11:13:57,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err50ASSERT_VIOLATIONDATA_RACE (276 of 336 remaining) [2025-03-17 11:13:57,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (275 of 336 remaining) [2025-03-17 11:13:57,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (274 of 336 remaining) [2025-03-17 11:13:57,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (273 of 336 remaining) [2025-03-17 11:13:57,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (272 of 336 remaining) [2025-03-17 11:13:57,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err69ASSERT_VIOLATIONDATA_RACE (271 of 336 remaining) [2025-03-17 11:13:57,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err68ASSERT_VIOLATIONDATA_RACE (270 of 336 remaining) [2025-03-17 11:13:57,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err67ASSERT_VIOLATIONDATA_RACE (269 of 336 remaining) [2025-03-17 11:13:57,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err66ASSERT_VIOLATIONDATA_RACE (268 of 336 remaining) [2025-03-17 11:13:57,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err65ASSERT_VIOLATIONDATA_RACE (267 of 336 remaining) [2025-03-17 11:13:57,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err64ASSERT_VIOLATIONDATA_RACE (266 of 336 remaining) [2025-03-17 11:13:57,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err63ASSERT_VIOLATIONDATA_RACE (265 of 336 remaining) [2025-03-17 11:13:57,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err62ASSERT_VIOLATIONDATA_RACE (264 of 336 remaining) [2025-03-17 11:13:57,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err61ASSERT_VIOLATIONDATA_RACE (263 of 336 remaining) [2025-03-17 11:13:57,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err60ASSERT_VIOLATIONDATA_RACE (262 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err59ASSERT_VIOLATIONDATA_RACE (261 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (260 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (259 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (258 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (257 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (256 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (255 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (254 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (253 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (252 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (251 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (250 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (249 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (248 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (247 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (246 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (245 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (244 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (243 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (242 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (241 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (240 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (239 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (238 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (237 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (236 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (235 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (234 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (233 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (232 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (231 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (230 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (229 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (228 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (227 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (226 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (225 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (224 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (223 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (222 of 336 remaining) [2025-03-17 11:13:57,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (221 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (220 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (219 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (218 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (217 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (216 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (215 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (214 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (213 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (212 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (211 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (210 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (209 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (208 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (207 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (206 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (205 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (204 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (203 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (202 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (201 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (200 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (199 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (198 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (197 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (196 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (195 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (194 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (193 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (192 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (191 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (190 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (189 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (188 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (187 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (186 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (185 of 336 remaining) [2025-03-17 11:13:57,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (184 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (183 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (182 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (181 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (180 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (179 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (178 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (177 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (176 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (175 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err24ASSERT_VIOLATIONDATA_RACE (174 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (173 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (172 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (171 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (170 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (169 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (168 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (167 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (166 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (165 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (164 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err23ASSERT_VIOLATIONDATA_RACE (163 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err22ASSERT_VIOLATIONDATA_RACE (162 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (161 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (160 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (159 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (158 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (157 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (156 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (155 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (154 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (153 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (152 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (151 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (150 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err74ASSERT_VIOLATIONDATA_RACE (149 of 336 remaining) [2025-03-17 11:13:57,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (148 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (147 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (146 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (145 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (144 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (143 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (142 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (141 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (140 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (139 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (138 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (137 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (136 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err73ASSERT_VIOLATIONDATA_RACE (135 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (134 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (133 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (132 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (131 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (130 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (129 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (128 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (127 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (126 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (125 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err72ASSERT_VIOLATIONDATA_RACE (124 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (123 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (122 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (121 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (120 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (119 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (118 of 336 remaining) [2025-03-17 11:13:57,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (117 of 336 remaining) [2025-03-17 11:13:57,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (116 of 336 remaining) [2025-03-17 11:13:57,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (115 of 336 remaining) [2025-03-17 11:13:57,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (114 of 336 remaining) [2025-03-17 11:13:57,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err71ASSERT_VIOLATIONDATA_RACE (113 of 336 remaining) [2025-03-17 11:13:57,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (112 of 336 remaining) [2025-03-17 11:13:57,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (111 of 336 remaining) [2025-03-17 11:13:57,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (110 of 336 remaining) [2025-03-17 11:13:57,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (109 of 336 remaining) [2025-03-17 11:13:57,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (108 of 336 remaining) [2025-03-17 11:13:57,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (107 of 336 remaining) [2025-03-17 11:13:57,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (106 of 336 remaining) [2025-03-17 11:13:57,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (105 of 336 remaining) [2025-03-17 11:13:57,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (104 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (103 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (102 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (101 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (100 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err70ASSERT_VIOLATIONDATA_RACE (99 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err58ASSERT_VIOLATIONDATA_RACE (98 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err57ASSERT_VIOLATIONDATA_RACE (97 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err56ASSERT_VIOLATIONDATA_RACE (96 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err55ASSERT_VIOLATIONDATA_RACE (95 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err54ASSERT_VIOLATIONDATA_RACE (94 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err53ASSERT_VIOLATIONDATA_RACE (93 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err52ASSERT_VIOLATIONDATA_RACE (92 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err51ASSERT_VIOLATIONDATA_RACE (91 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err50ASSERT_VIOLATIONDATA_RACE (90 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (89 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (88 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (87 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (86 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err69ASSERT_VIOLATIONDATA_RACE (85 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err68ASSERT_VIOLATIONDATA_RACE (84 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err67ASSERT_VIOLATIONDATA_RACE (83 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err66ASSERT_VIOLATIONDATA_RACE (82 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err65ASSERT_VIOLATIONDATA_RACE (81 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err64ASSERT_VIOLATIONDATA_RACE (80 of 336 remaining) [2025-03-17 11:13:57,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err63ASSERT_VIOLATIONDATA_RACE (79 of 336 remaining) [2025-03-17 11:13:57,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err62ASSERT_VIOLATIONDATA_RACE (78 of 336 remaining) [2025-03-17 11:13:57,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err61ASSERT_VIOLATIONDATA_RACE (77 of 336 remaining) [2025-03-17 11:13:57,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err60ASSERT_VIOLATIONDATA_RACE (76 of 336 remaining) [2025-03-17 11:13:57,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err59ASSERT_VIOLATIONDATA_RACE (75 of 336 remaining) [2025-03-17 11:13:57,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (74 of 336 remaining) [2025-03-17 11:13:57,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (73 of 336 remaining) [2025-03-17 11:13:57,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (72 of 336 remaining) [2025-03-17 11:13:57,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (71 of 336 remaining) [2025-03-17 11:13:57,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (70 of 336 remaining) [2025-03-17 11:13:57,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (69 of 336 remaining) [2025-03-17 11:13:57,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (68 of 336 remaining) [2025-03-17 11:13:57,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (67 of 336 remaining) [2025-03-17 11:13:57,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (66 of 336 remaining) [2025-03-17 11:13:57,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (65 of 336 remaining) [2025-03-17 11:13:57,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (64 of 336 remaining) [2025-03-17 11:13:57,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (63 of 336 remaining) [2025-03-17 11:13:57,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (62 of 336 remaining) [2025-03-17 11:13:57,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (61 of 336 remaining) [2025-03-17 11:13:57,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (60 of 336 remaining) [2025-03-17 11:13:57,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (59 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (58 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (57 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (56 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (55 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (54 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (53 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (52 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (51 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (50 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (49 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (48 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (47 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (46 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (45 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (44 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (43 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (42 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (41 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (40 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (39 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (38 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (37 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (36 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (35 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (34 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (33 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (32 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (31 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (30 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (29 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (28 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (27 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (26 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (25 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err24ASSERT_VIOLATIONDATA_RACE (24 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (23 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (22 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (21 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (20 of 336 remaining) [2025-03-17 11:13:57,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (19 of 336 remaining) [2025-03-17 11:13:57,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (18 of 336 remaining) [2025-03-17 11:13:57,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (17 of 336 remaining) [2025-03-17 11:13:57,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (16 of 336 remaining) [2025-03-17 11:13:57,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (15 of 336 remaining) [2025-03-17 11:13:57,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (14 of 336 remaining) [2025-03-17 11:13:57,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err23ASSERT_VIOLATIONDATA_RACE (13 of 336 remaining) [2025-03-17 11:13:57,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err22ASSERT_VIOLATIONDATA_RACE (12 of 336 remaining) [2025-03-17 11:13:57,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (11 of 336 remaining) [2025-03-17 11:13:57,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (10 of 336 remaining) [2025-03-17 11:13:57,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (9 of 336 remaining) [2025-03-17 11:13:57,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (8 of 336 remaining) [2025-03-17 11:13:57,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (7 of 336 remaining) [2025-03-17 11:13:57,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (6 of 336 remaining) [2025-03-17 11:13:57,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (5 of 336 remaining) [2025-03-17 11:13:57,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (4 of 336 remaining) [2025-03-17 11:13:57,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (3 of 336 remaining) [2025-03-17 11:13:57,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (2 of 336 remaining) [2025-03-17 11:13:57,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (1 of 336 remaining) [2025-03-17 11:13:57,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (0 of 336 remaining) [2025-03-17 11:13:57,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 11:13:57,216 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:57,227 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:13:57,227 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:13:57,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:13:57 BasicIcfg [2025-03-17 11:13:57,236 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:13:57,236 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:13:57,236 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:13:57,237 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:13:57,237 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:41" (3/4) ... [2025-03-17 11:13:57,239 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:13:57,242 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 11:13:57,242 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 11:13:57,242 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-17 11:13:57,243 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-03-17 11:13:57,253 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2025-03-17 11:13:57,253 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:13:57,254 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 11:13:57,254 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:13:57,338 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:13:57,339 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:13:57,339 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:13:57,341 INFO L158 Benchmark]: Toolchain (without parser) took 17935.12ms. Allocated memory was 142.6MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 106.0MB in the beginning and 811.2MB in the end (delta: -705.2MB). Peak memory consumption was 980.7MB. Max. memory is 16.1GB. [2025-03-17 11:13:57,341 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:13:57,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.78ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 89.2MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:13:57,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.46ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 83.8MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:13:57,343 INFO L158 Benchmark]: Boogie Preprocessor took 56.34ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 78.9MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:13:57,344 INFO L158 Benchmark]: IcfgBuilder took 1681.67ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 78.9MB in the beginning and 251.7MB in the end (delta: -172.8MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. [2025-03-17 11:13:57,344 INFO L158 Benchmark]: TraceAbstraction took 15814.24ms. Allocated memory was 335.5MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 250.7MB in the beginning and 819.6MB in the end (delta: -568.9MB). Peak memory consumption was 925.1MB. Max. memory is 16.1GB. [2025-03-17 11:13:57,344 INFO L158 Benchmark]: Witness Printer took 102.73ms. Allocated memory is still 1.8GB. Free memory was 819.6MB in the beginning and 811.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:13:57,345 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.17ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.78ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 89.2MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.46ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 83.8MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.34ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 78.9MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1681.67ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 78.9MB in the beginning and 251.7MB in the end (delta: -172.8MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. * TraceAbstraction took 15814.24ms. Allocated memory was 335.5MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 250.7MB in the beginning and 819.6MB in the end (delta: -568.9MB). Peak memory consumption was 925.1MB. Max. memory is 16.1GB. * Witness Printer took 102.73ms. Allocated memory is still 1.8GB. Free memory was 819.6MB in the beginning and 811.2MB 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: 53]: 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: 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: 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: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: 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: 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: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: 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: 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: 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: 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: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: 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: 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: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: 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: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: 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: 135]: 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: 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: 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: 170]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 172]: 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: 174]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 174]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 175]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 217]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 175]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 177]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 178]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 178]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 179]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 180]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 217]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 180]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 182]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 183]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 183]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 184]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 185]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 217]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 185]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 187]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 188]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 188]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 189]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 190]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 217]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 190]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 192]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 193]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 205]: 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: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: 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: 150]: 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: 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: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 158]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 158]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: 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 9 procedures, 890 locations, 942 edges, 336 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: 15.6s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 699 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 349 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1992 IncrementalHoareTripleChecker+Invalid, 2128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 148 mSDtfsCounter, 1992 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1358occurred in iteration=0, InterpolantAutomatonStates: 102, 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.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 5785 NumberOfCodeBlocks, 5785 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 5752 ConstructedInterpolants, 0 QuantifiedInterpolants, 5931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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 182 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:13:57,373 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