./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 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-commit-1.wvr.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 73c55a951ef2b92a665c2c32d76e33a5a03bdbde67ee3c8e6748faf493088c7e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:55:07,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:55:07,096 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:55:07,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:55:07,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:55:07,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:55:07,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:55:07,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:55:07,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:55:07,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:55:07,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:55:07,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:55:07,125 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:55:07,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:55:07,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:55:07,125 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:55:07,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:55:07,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:55:07,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:55:07,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:55:07,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:55:07,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:55:07,125 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:55:07,125 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:55:07,125 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:55:07,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:55:07,125 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:55:07,125 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:55:07,126 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:55:07,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:55:07,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:55:07,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:55:07,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:55:07,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:55:07,126 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:55:07,126 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:55:07,126 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:55:07,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:55:07,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:55:07,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:55:07,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:55:07,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:55:07,126 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 -> 73c55a951ef2b92a665c2c32d76e33a5a03bdbde67ee3c8e6748faf493088c7e [2025-03-04 06:55:07,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:55:07,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:55:07,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:55:07,362 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:55:07,363 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:55:07,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c [2025-03-04 06:55:08,502 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a6fcdec0/2ced0b62f39148ab92cc6e509d6cccd6/FLAGd3e047f3f [2025-03-04 06:55:08,771 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:55:08,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-commit-1.wvr.c [2025-03-04 06:55:08,780 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a6fcdec0/2ced0b62f39148ab92cc6e509d6cccd6/FLAGd3e047f3f [2025-03-04 06:55:09,082 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a6fcdec0/2ced0b62f39148ab92cc6e509d6cccd6 [2025-03-04 06:55:09,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:55:09,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:55:09,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:55:09,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:55:09,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:55:09,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:55:09" (1/1) ... [2025-03-04 06:55:09,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ba6734e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:09, skipping insertion in model container [2025-03-04 06:55:09,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:55:09" (1/1) ... [2025-03-04 06:55:09,111 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:55:09,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:55:09,297 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:55:09,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:55:09,359 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:55:09,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:09 WrapperNode [2025-03-04 06:55:09,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:55:09,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:55:09,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:55:09,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:55:09,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:09" (1/1) ... [2025-03-04 06:55:09,380 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:09" (1/1) ... [2025-03-04 06:55:09,407 INFO L138 Inliner]: procedures = 24, calls = 54, calls flagged for inlining = 21, calls inlined = 25, statements flattened = 694 [2025-03-04 06:55:09,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:55:09,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:55:09,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:55:09,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:55:09,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:09" (1/1) ... [2025-03-04 06:55:09,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:09" (1/1) ... [2025-03-04 06:55:09,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:09" (1/1) ... [2025-03-04 06:55:09,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:09" (1/1) ... [2025-03-04 06:55:09,446 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:09" (1/1) ... [2025-03-04 06:55:09,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:09" (1/1) ... [2025-03-04 06:55:09,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:09" (1/1) ... [2025-03-04 06:55:09,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:09" (1/1) ... [2025-03-04 06:55:09,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:55:09,458 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:55:09,458 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:55:09,458 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:55:09,459 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:09" (1/1) ... [2025-03-04 06:55:09,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:55:09,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:55:09,485 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-04 06:55:09,491 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-04 06:55:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:55:09,507 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:55:09,507 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:55:09,507 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:55:09,507 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:55:09,507 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 06:55:09,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 06:55:09,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:55:09,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:55:09,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:55:09,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:55:09,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:55:09,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:55:09,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:55:09,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:55:09,510 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:55:09,626 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:55:09,628 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:55:10,387 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:55:10,387 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:55:10,827 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:55:10,829 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:55:10,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:55:10 BoogieIcfgContainer [2025-03-04 06:55:10,830 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:55:10,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:55:10,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:55:10,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:55:10,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:55:09" (1/3) ... [2025-03-04 06:55:10,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30601683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:55:10, skipping insertion in model container [2025-03-04 06:55:10,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:09" (2/3) ... [2025-03-04 06:55:10,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30601683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:55:10, skipping insertion in model container [2025-03-04 06:55:10,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:55:10" (3/3) ... [2025-03-04 06:55:10,839 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2025-03-04 06:55:10,852 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:55:10,853 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-commit-1.wvr.c that has 4 procedures, 453 locations, 1 initial locations, 6 loop locations, and 113 error locations. [2025-03-04 06:55:10,854 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:55:10,975 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:55:11,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 462 places, 468 transitions, 957 flow [2025-03-04 06:55:11,139 INFO L124 PetriNetUnfolderBase]: 16/465 cut-off events. [2025-03-04 06:55:11,141 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:55:11,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 465 events. 16/465 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 789 event pairs, 0 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 410. Up to 2 conditions per place. [2025-03-04 06:55:11,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 462 places, 468 transitions, 957 flow [2025-03-04 06:55:11,160 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 443 places, 448 transitions, 914 flow [2025-03-04 06:55:11,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:55:11,177 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;@3b3a43ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:55:11,178 INFO L334 AbstractCegarLoop]: Starting to check reachability of 204 error locations. [2025-03-04 06:55:11,186 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:55:11,187 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-03-04 06:55:11,187 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:55:11,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:11,188 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] [2025-03-04 06:55:11,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:11,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:11,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1537914072, now seen corresponding path program 1 times [2025-03-04 06:55:11,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:11,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632226634] [2025-03-04 06:55:11,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:11,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:11,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 06:55:11,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 06:55:11,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:11,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:11,364 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-04 06:55:11,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:11,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632226634] [2025-03-04 06:55:11,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632226634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:11,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:11,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:11,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138911974] [2025-03-04 06:55:11,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:11,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:11,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:11,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:11,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:11,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 468 [2025-03-04 06:55:11,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 448 transitions, 914 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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-04 06:55:11,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:11,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 468 [2025-03-04 06:55:11,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:11,724 INFO L124 PetriNetUnfolderBase]: 157/853 cut-off events. [2025-03-04 06:55:11,725 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-03-04 06:55:11,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 853 events. 157/853 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3597 event pairs, 86 based on Foata normal form. 110/884 useless extension candidates. Maximal degree in co-relation 785. Up to 234 conditions per place. [2025-03-04 06:55:11,734 INFO L140 encePairwiseOnDemand]: 368/468 looper letters, 18 selfloop transitions, 2 changer transitions 6/350 dead transitions. [2025-03-04 06:55:11,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 350 transitions, 758 flow [2025-03-04 06:55:11,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:11,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1159 transitions. [2025-03-04 06:55:11,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8254985754985755 [2025-03-04 06:55:11,754 INFO L175 Difference]: Start difference. First operand has 443 places, 448 transitions, 914 flow. Second operand 3 states and 1159 transitions. [2025-03-04 06:55:11,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 350 transitions, 758 flow [2025-03-04 06:55:11,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 350 transitions, 746 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 06:55:11,770 INFO L231 Difference]: Finished difference. Result has 350 places, 344 transitions, 698 flow [2025-03-04 06:55:11,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=350, PETRI_TRANSITIONS=344} [2025-03-04 06:55:11,777 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -93 predicate places. [2025-03-04 06:55:11,779 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 344 transitions, 698 flow [2025-03-04 06:55:11,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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-04 06:55:11,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:11,780 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] [2025-03-04 06:55:11,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:55:11,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:11,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:11,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1477379151, now seen corresponding path program 1 times [2025-03-04 06:55:11,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:11,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127496220] [2025-03-04 06:55:11,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:11,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:11,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 06:55:11,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 06:55:11,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:11,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:11,847 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-04 06:55:11,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:11,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127496220] [2025-03-04 06:55:11,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127496220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:11,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:11,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:11,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358165716] [2025-03-04 06:55:11,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:11,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:11,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:11,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:11,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:11,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 468 [2025-03-04 06:55:11,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 344 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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-04 06:55:11,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:11,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 468 [2025-03-04 06:55:11,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:12,105 INFO L124 PetriNetUnfolderBase]: 157/846 cut-off events. [2025-03-04 06:55:12,106 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-04 06:55:12,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 846 events. 157/846 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3618 event pairs, 86 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 1068. Up to 234 conditions per place. [2025-03-04 06:55:12,111 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 18 selfloop transitions, 2 changer transitions 0/343 dead transitions. [2025-03-04 06:55:12,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 343 transitions, 736 flow [2025-03-04 06:55:12,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:12,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:12,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2025-03-04 06:55:12,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7564102564102564 [2025-03-04 06:55:12,117 INFO L175 Difference]: Start difference. First operand has 350 places, 344 transitions, 698 flow. Second operand 3 states and 1062 transitions. [2025-03-04 06:55:12,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 343 transitions, 736 flow [2025-03-04 06:55:12,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 343 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:12,126 INFO L231 Difference]: Finished difference. Result has 343 places, 343 transitions, 696 flow [2025-03-04 06:55:12,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=343, PETRI_TRANSITIONS=343} [2025-03-04 06:55:12,127 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -100 predicate places. [2025-03-04 06:55:12,127 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 343 transitions, 696 flow [2025-03-04 06:55:12,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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-04 06:55:12,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:12,128 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] [2025-03-04 06:55:12,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:55:12,129 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:12,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:12,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1545893047, now seen corresponding path program 1 times [2025-03-04 06:55:12,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:12,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090522358] [2025-03-04 06:55:12,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:12,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:12,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 06:55:12,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 06:55:12,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:12,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:12,188 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-04 06:55:12,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:12,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090522358] [2025-03-04 06:55:12,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090522358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:12,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:12,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:12,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576473246] [2025-03-04 06:55:12,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:12,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:12,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:12,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:12,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:12,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 468 [2025-03-04 06:55:12,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 343 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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-04 06:55:12,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:12,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 468 [2025-03-04 06:55:12,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:12,386 INFO L124 PetriNetUnfolderBase]: 157/845 cut-off events. [2025-03-04 06:55:12,386 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-04 06:55:12,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 845 events. 157/845 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3617 event pairs, 86 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 1059. Up to 234 conditions per place. [2025-03-04 06:55:12,390 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 18 selfloop transitions, 2 changer transitions 0/342 dead transitions. [2025-03-04 06:55:12,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 342 transitions, 734 flow [2025-03-04 06:55:12,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:12,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2025-03-04 06:55:12,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7564102564102564 [2025-03-04 06:55:12,393 INFO L175 Difference]: Start difference. First operand has 343 places, 343 transitions, 696 flow. Second operand 3 states and 1062 transitions. [2025-03-04 06:55:12,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 342 transitions, 734 flow [2025-03-04 06:55:12,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 342 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:12,397 INFO L231 Difference]: Finished difference. Result has 342 places, 342 transitions, 694 flow [2025-03-04 06:55:12,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=342, PETRI_TRANSITIONS=342} [2025-03-04 06:55:12,398 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -101 predicate places. [2025-03-04 06:55:12,398 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 342 transitions, 694 flow [2025-03-04 06:55:12,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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-04 06:55:12,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:12,399 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] [2025-03-04 06:55:12,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:55:12,399 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:12,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:12,399 INFO L85 PathProgramCache]: Analyzing trace with hash 443839878, now seen corresponding path program 1 times [2025-03-04 06:55:12,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:12,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243457616] [2025-03-04 06:55:12,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:12,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:12,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 06:55:12,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 06:55:12,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:12,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:12,445 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-04 06:55:12,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:12,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243457616] [2025-03-04 06:55:12,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243457616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:12,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:12,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:12,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140020278] [2025-03-04 06:55:12,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:12,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:12,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:12,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:12,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:12,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 468 [2025-03-04 06:55:12,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 342 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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-04 06:55:12,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:12,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 468 [2025-03-04 06:55:12,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:12,598 INFO L124 PetriNetUnfolderBase]: 174/813 cut-off events. [2025-03-04 06:55:12,598 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-04 06:55:12,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 813 events. 174/813 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3195 event pairs, 25 based on Foata normal form. 0/755 useless extension candidates. Maximal degree in co-relation 1048. Up to 203 conditions per place. [2025-03-04 06:55:12,603 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 25 selfloop transitions, 2 changer transitions 0/351 dead transitions. [2025-03-04 06:55:12,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 351 transitions, 771 flow [2025-03-04 06:55:12,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1081 transitions. [2025-03-04 06:55:12,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.76994301994302 [2025-03-04 06:55:12,606 INFO L175 Difference]: Start difference. First operand has 342 places, 342 transitions, 694 flow. Second operand 3 states and 1081 transitions. [2025-03-04 06:55:12,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 351 transitions, 771 flow [2025-03-04 06:55:12,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 351 transitions, 767 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:12,611 INFO L231 Difference]: Finished difference. Result has 342 places, 342 transitions, 698 flow [2025-03-04 06:55:12,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=342, PETRI_TRANSITIONS=342} [2025-03-04 06:55:12,612 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -101 predicate places. [2025-03-04 06:55:12,613 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 342 transitions, 698 flow [2025-03-04 06:55:12,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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-04 06:55:12,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:12,614 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] [2025-03-04 06:55:12,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:55:12,614 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:12,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:12,615 INFO L85 PathProgramCache]: Analyzing trace with hash 998800758, now seen corresponding path program 1 times [2025-03-04 06:55:12,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:12,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958277167] [2025-03-04 06:55:12,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:12,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:12,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 06:55:12,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 06:55:12,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:12,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:12,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:12,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958277167] [2025-03-04 06:55:12,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958277167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:12,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:12,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:12,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794443793] [2025-03-04 06:55:12,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:12,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:12,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:12,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:12,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:12,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 468 [2025-03-04 06:55:12,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 342 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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-04 06:55:12,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:12,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 468 [2025-03-04 06:55:12,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:12,816 INFO L124 PetriNetUnfolderBase]: 174/924 cut-off events. [2025-03-04 06:55:12,816 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-04 06:55:12,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 924 events. 174/924 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4214 event pairs, 101 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 524. Up to 264 conditions per place. [2025-03-04 06:55:12,823 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 18 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2025-03-04 06:55:12,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 341 transitions, 736 flow [2025-03-04 06:55:12,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:12,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-03-04 06:55:12,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7578347578347578 [2025-03-04 06:55:12,827 INFO L175 Difference]: Start difference. First operand has 342 places, 342 transitions, 698 flow. Second operand 3 states and 1064 transitions. [2025-03-04 06:55:12,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 341 transitions, 736 flow [2025-03-04 06:55:12,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 341 transitions, 734 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:12,832 INFO L231 Difference]: Finished difference. Result has 342 places, 341 transitions, 698 flow [2025-03-04 06:55:12,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=342, PETRI_TRANSITIONS=341} [2025-03-04 06:55:12,834 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -101 predicate places. [2025-03-04 06:55:12,834 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 341 transitions, 698 flow [2025-03-04 06:55:12,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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-04 06:55:12,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:12,836 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:12,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:55:12,836 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:12,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:12,836 INFO L85 PathProgramCache]: Analyzing trace with hash -258416603, now seen corresponding path program 1 times [2025-03-04 06:55:12,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:12,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128260980] [2025-03-04 06:55:12,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:12,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:12,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 06:55:12,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 06:55:12,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:12,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:12,888 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-04 06:55:12,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:12,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128260980] [2025-03-04 06:55:12,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128260980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:12,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:12,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:12,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651733258] [2025-03-04 06:55:12,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:12,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:12,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:12,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:12,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:12,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 468 [2025-03-04 06:55:12,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 341 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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-04 06:55:12,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:12,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 468 [2025-03-04 06:55:12,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:13,035 INFO L124 PetriNetUnfolderBase]: 174/923 cut-off events. [2025-03-04 06:55:13,036 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-04 06:55:13,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1237 conditions, 923 events. 174/923 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4194 event pairs, 101 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 1175. Up to 262 conditions per place. [2025-03-04 06:55:13,039 INFO L140 encePairwiseOnDemand]: 466/468 looper letters, 17 selfloop transitions, 1 changer transitions 0/340 dead transitions. [2025-03-04 06:55:13,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 340 transitions, 732 flow [2025-03-04 06:55:13,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:13,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1071 transitions. [2025-03-04 06:55:13,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7628205128205128 [2025-03-04 06:55:13,042 INFO L175 Difference]: Start difference. First operand has 342 places, 341 transitions, 698 flow. Second operand 3 states and 1071 transitions. [2025-03-04 06:55:13,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 340 transitions, 732 flow [2025-03-04 06:55:13,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 340 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:13,047 INFO L231 Difference]: Finished difference. Result has 341 places, 340 transitions, 694 flow [2025-03-04 06:55:13,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=341, PETRI_TRANSITIONS=340} [2025-03-04 06:55:13,048 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -102 predicate places. [2025-03-04 06:55:13,049 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 340 transitions, 694 flow [2025-03-04 06:55:13,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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-04 06:55:13,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:13,050 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] [2025-03-04 06:55:13,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:55:13,050 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:13,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:13,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1676490926, now seen corresponding path program 1 times [2025-03-04 06:55:13,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:13,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177869915] [2025-03-04 06:55:13,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:13,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:13,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 06:55:13,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 06:55:13,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:13,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:13,121 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-04 06:55:13,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:13,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177869915] [2025-03-04 06:55:13,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177869915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:13,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:13,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:13,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148753834] [2025-03-04 06:55:13,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:13,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:13,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:13,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:13,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:13,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 468 [2025-03-04 06:55:13,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 340 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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-04 06:55:13,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:13,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 468 [2025-03-04 06:55:13,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:13,270 INFO L124 PetriNetUnfolderBase]: 174/922 cut-off events. [2025-03-04 06:55:13,271 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-04 06:55:13,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1237 conditions, 922 events. 174/922 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4189 event pairs, 101 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 1175. Up to 264 conditions per place. [2025-03-04 06:55:13,274 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 18 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2025-03-04 06:55:13,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 339 transitions, 732 flow [2025-03-04 06:55:13,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:13,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-03-04 06:55:13,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7578347578347578 [2025-03-04 06:55:13,276 INFO L175 Difference]: Start difference. First operand has 341 places, 340 transitions, 694 flow. Second operand 3 states and 1064 transitions. [2025-03-04 06:55:13,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 339 transitions, 732 flow [2025-03-04 06:55:13,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 339 transitions, 731 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:13,281 INFO L231 Difference]: Finished difference. Result has 341 places, 339 transitions, 695 flow [2025-03-04 06:55:13,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=341, PETRI_TRANSITIONS=339} [2025-03-04 06:55:13,282 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -102 predicate places. [2025-03-04 06:55:13,282 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 339 transitions, 695 flow [2025-03-04 06:55:13,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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-04 06:55:13,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:13,282 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] [2025-03-04 06:55:13,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:55:13,283 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:13,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:13,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1184627071, now seen corresponding path program 1 times [2025-03-04 06:55:13,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:13,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276746831] [2025-03-04 06:55:13,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:13,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:13,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 06:55:13,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 06:55:13,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:13,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:13,756 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-04 06:55:13,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:13,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276746831] [2025-03-04 06:55:13,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276746831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:13,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:13,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:55:13,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730775727] [2025-03-04 06:55:13,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:13,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:55:13,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:13,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:55:13,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:55:13,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 468 [2025-03-04 06:55:13,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 339 transitions, 695 flow. Second operand has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 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-04 06:55:13,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:13,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 468 [2025-03-04 06:55:13,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:14,100 INFO L124 PetriNetUnfolderBase]: 174/919 cut-off events. [2025-03-04 06:55:14,100 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-04 06:55:14,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1270 conditions, 919 events. 174/919 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4176 event pairs, 101 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 1209. Up to 285 conditions per place. [2025-03-04 06:55:14,104 INFO L140 encePairwiseOnDemand]: 450/468 looper letters, 39 selfloop transitions, 15 changer transitions 0/336 dead transitions. [2025-03-04 06:55:14,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 336 transitions, 797 flow [2025-03-04 06:55:14,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:55:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:55:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1934 transitions. [2025-03-04 06:55:14,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6887464387464387 [2025-03-04 06:55:14,108 INFO L175 Difference]: Start difference. First operand has 341 places, 339 transitions, 695 flow. Second operand 6 states and 1934 transitions. [2025-03-04 06:55:14,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 336 transitions, 797 flow [2025-03-04 06:55:14,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 336 transitions, 793 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:14,113 INFO L231 Difference]: Finished difference. Result has 341 places, 336 transitions, 715 flow [2025-03-04 06:55:14,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=715, PETRI_PLACES=341, PETRI_TRANSITIONS=336} [2025-03-04 06:55:14,115 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -102 predicate places. [2025-03-04 06:55:14,115 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 336 transitions, 715 flow [2025-03-04 06:55:14,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 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-04 06:55:14,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:14,116 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] [2025-03-04 06:55:14,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:55:14,116 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:14,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:14,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1785196409, now seen corresponding path program 1 times [2025-03-04 06:55:14,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:14,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483830961] [2025-03-04 06:55:14,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:14,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:14,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 06:55:14,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 06:55:14,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:14,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:14,164 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-04 06:55:14,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:14,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483830961] [2025-03-04 06:55:14,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483830961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:14,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:14,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:14,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651786896] [2025-03-04 06:55:14,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:14,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:14,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:14,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:14,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:14,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 468 [2025-03-04 06:55:14,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 336 transitions, 715 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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-04 06:55:14,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:14,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 468 [2025-03-04 06:55:14,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:14,325 INFO L124 PetriNetUnfolderBase]: 174/918 cut-off events. [2025-03-04 06:55:14,325 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-04 06:55:14,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 918 events. 174/918 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4209 event pairs, 101 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 1200. Up to 265 conditions per place. [2025-03-04 06:55:14,328 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 19 selfloop transitions, 2 changer transitions 0/335 dead transitions. [2025-03-04 06:55:14,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 335 transitions, 755 flow [2025-03-04 06:55:14,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2025-03-04 06:55:14,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7564102564102564 [2025-03-04 06:55:14,330 INFO L175 Difference]: Start difference. First operand has 341 places, 336 transitions, 715 flow. Second operand 3 states and 1062 transitions. [2025-03-04 06:55:14,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 335 transitions, 755 flow [2025-03-04 06:55:14,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 335 transitions, 725 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:55:14,334 INFO L231 Difference]: Finished difference. Result has 337 places, 335 transitions, 687 flow [2025-03-04 06:55:14,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=687, PETRI_PLACES=337, PETRI_TRANSITIONS=335} [2025-03-04 06:55:14,336 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -106 predicate places. [2025-03-04 06:55:14,336 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 335 transitions, 687 flow [2025-03-04 06:55:14,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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-04 06:55:14,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:14,337 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] [2025-03-04 06:55:14,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:55:14,337 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:14,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:14,338 INFO L85 PathProgramCache]: Analyzing trace with hash 278838995, now seen corresponding path program 1 times [2025-03-04 06:55:14,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:14,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004690033] [2025-03-04 06:55:14,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:14,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:14,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:55:14,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:55:14,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:14,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:14,368 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-04 06:55:14,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:14,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004690033] [2025-03-04 06:55:14,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004690033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:14,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:14,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:14,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490374744] [2025-03-04 06:55:14,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:14,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:14,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:14,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:14,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:14,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 468 [2025-03-04 06:55:14,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 335 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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-04 06:55:14,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:14,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 468 [2025-03-04 06:55:14,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:14,534 INFO L124 PetriNetUnfolderBase]: 221/1018 cut-off events. [2025-03-04 06:55:14,534 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-03-04 06:55:14,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 1018 events. 221/1018 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4972 event pairs, 70 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1352. Up to 172 conditions per place. [2025-03-04 06:55:14,540 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 28 selfloop transitions, 2 changer transitions 0/346 dead transitions. [2025-03-04 06:55:14,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 346 transitions, 776 flow [2025-03-04 06:55:14,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:14,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:14,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1082 transitions. [2025-03-04 06:55:14,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7706552706552706 [2025-03-04 06:55:14,542 INFO L175 Difference]: Start difference. First operand has 337 places, 335 transitions, 687 flow. Second operand 3 states and 1082 transitions. [2025-03-04 06:55:14,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 346 transitions, 776 flow [2025-03-04 06:55:14,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 346 transitions, 772 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:14,547 INFO L231 Difference]: Finished difference. Result has 337 places, 335 transitions, 691 flow [2025-03-04 06:55:14,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=337, PETRI_TRANSITIONS=335} [2025-03-04 06:55:14,547 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -106 predicate places. [2025-03-04 06:55:14,547 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 335 transitions, 691 flow [2025-03-04 06:55:14,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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-04 06:55:14,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:14,548 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] [2025-03-04 06:55:14,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:55:14,548 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:14,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:14,549 INFO L85 PathProgramCache]: Analyzing trace with hash 365291731, now seen corresponding path program 1 times [2025-03-04 06:55:14,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:14,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141941450] [2025-03-04 06:55:14,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:14,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:14,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 06:55:14,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 06:55:14,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:14,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:14,576 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-04 06:55:14,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:14,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141941450] [2025-03-04 06:55:14,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141941450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:14,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:14,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:14,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291693996] [2025-03-04 06:55:14,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:14,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:14,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:14,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:14,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:14,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 468 [2025-03-04 06:55:14,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 335 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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-04 06:55:14,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:14,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 468 [2025-03-04 06:55:14,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:14,743 INFO L124 PetriNetUnfolderBase]: 221/1001 cut-off events. [2025-03-04 06:55:14,743 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-03-04 06:55:14,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1467 conditions, 1001 events. 221/1001 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4870 event pairs, 138 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1404. Up to 337 conditions per place. [2025-03-04 06:55:14,749 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 19 selfloop transitions, 2 changer transitions 0/334 dead transitions. [2025-03-04 06:55:14,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 334 transitions, 731 flow [2025-03-04 06:55:14,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:14,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-03-04 06:55:14,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7578347578347578 [2025-03-04 06:55:14,751 INFO L175 Difference]: Start difference. First operand has 337 places, 335 transitions, 691 flow. Second operand 3 states and 1064 transitions. [2025-03-04 06:55:14,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 334 transitions, 731 flow [2025-03-04 06:55:14,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 334 transitions, 729 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:14,755 INFO L231 Difference]: Finished difference. Result has 337 places, 334 transitions, 691 flow [2025-03-04 06:55:14,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=337, PETRI_TRANSITIONS=334} [2025-03-04 06:55:14,755 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -106 predicate places. [2025-03-04 06:55:14,755 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 334 transitions, 691 flow [2025-03-04 06:55:14,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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-04 06:55:14,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:14,756 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] [2025-03-04 06:55:14,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:55:14,756 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:14,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:14,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1829766786, now seen corresponding path program 1 times [2025-03-04 06:55:14,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:14,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443817486] [2025-03-04 06:55:14,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:14,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:14,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 06:55:14,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 06:55:14,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:14,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:14,784 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-04 06:55:14,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:14,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443817486] [2025-03-04 06:55:14,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443817486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:14,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:14,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:14,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106682091] [2025-03-04 06:55:14,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:14,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:14,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:14,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:14,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:14,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 468 [2025-03-04 06:55:14,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 334 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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-04 06:55:14,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:14,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 468 [2025-03-04 06:55:14,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:14,951 INFO L124 PetriNetUnfolderBase]: 221/1000 cut-off events. [2025-03-04 06:55:14,951 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-03-04 06:55:14,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1446 conditions, 1000 events. 221/1000 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4872 event pairs, 138 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1383. Up to 338 conditions per place. [2025-03-04 06:55:14,955 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 20 selfloop transitions, 2 changer transitions 0/333 dead transitions. [2025-03-04 06:55:14,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 333 transitions, 733 flow [2025-03-04 06:55:14,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:14,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:14,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2025-03-04 06:55:14,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7564102564102564 [2025-03-04 06:55:14,957 INFO L175 Difference]: Start difference. First operand has 337 places, 334 transitions, 691 flow. Second operand 3 states and 1062 transitions. [2025-03-04 06:55:14,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 333 transitions, 733 flow [2025-03-04 06:55:14,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 333 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:14,961 INFO L231 Difference]: Finished difference. Result has 336 places, 333 transitions, 689 flow [2025-03-04 06:55:14,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=336, PETRI_TRANSITIONS=333} [2025-03-04 06:55:14,962 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -107 predicate places. [2025-03-04 06:55:14,962 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 333 transitions, 689 flow [2025-03-04 06:55:14,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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-04 06:55:14,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:14,963 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] [2025-03-04 06:55:14,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:55:14,963 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:14,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:14,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1000057530, now seen corresponding path program 1 times [2025-03-04 06:55:14,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:14,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610585282] [2025-03-04 06:55:14,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:14,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:14,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 06:55:14,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 06:55:14,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:14,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:14,990 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-04 06:55:14,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:14,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610585282] [2025-03-04 06:55:14,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610585282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:14,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:14,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:14,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827546301] [2025-03-04 06:55:14,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:14,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:14,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:14,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:14,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:14,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 468 [2025-03-04 06:55:14,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 333 transitions, 689 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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-04 06:55:14,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:14,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 468 [2025-03-04 06:55:14,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:15,153 INFO L124 PetriNetUnfolderBase]: 221/999 cut-off events. [2025-03-04 06:55:15,153 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-03-04 06:55:15,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 999 events. 221/999 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4872 event pairs, 138 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1380. Up to 335 conditions per place. [2025-03-04 06:55:15,156 INFO L140 encePairwiseOnDemand]: 466/468 looper letters, 18 selfloop transitions, 1 changer transitions 0/332 dead transitions. [2025-03-04 06:55:15,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 332 transitions, 725 flow [2025-03-04 06:55:15,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:15,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1071 transitions. [2025-03-04 06:55:15,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7628205128205128 [2025-03-04 06:55:15,159 INFO L175 Difference]: Start difference. First operand has 336 places, 333 transitions, 689 flow. Second operand 3 states and 1071 transitions. [2025-03-04 06:55:15,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 332 transitions, 725 flow [2025-03-04 06:55:15,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 332 transitions, 721 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:15,162 INFO L231 Difference]: Finished difference. Result has 335 places, 332 transitions, 685 flow [2025-03-04 06:55:15,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=685, PETRI_PLACES=335, PETRI_TRANSITIONS=332} [2025-03-04 06:55:15,163 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -108 predicate places. [2025-03-04 06:55:15,163 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 332 transitions, 685 flow [2025-03-04 06:55:15,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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-04 06:55:15,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:15,163 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] [2025-03-04 06:55:15,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:55:15,164 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:15,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:15,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1687326645, now seen corresponding path program 1 times [2025-03-04 06:55:15,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:15,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712543723] [2025-03-04 06:55:15,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:15,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:15,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 06:55:15,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 06:55:15,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:15,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:15,198 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-04 06:55:15,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:15,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712543723] [2025-03-04 06:55:15,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712543723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:15,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:15,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:15,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266954096] [2025-03-04 06:55:15,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:15,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:15,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:15,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:15,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:15,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 468 [2025-03-04 06:55:15,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 332 transitions, 685 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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-04 06:55:15,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:15,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 468 [2025-03-04 06:55:15,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:15,416 INFO L124 PetriNetUnfolderBase]: 221/998 cut-off events. [2025-03-04 06:55:15,417 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-03-04 06:55:15,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 998 events. 221/998 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4886 event pairs, 138 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1379. Up to 337 conditions per place. [2025-03-04 06:55:15,422 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 19 selfloop transitions, 2 changer transitions 0/331 dead transitions. [2025-03-04 06:55:15,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 331 transitions, 725 flow [2025-03-04 06:55:15,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:15,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-03-04 06:55:15,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7578347578347578 [2025-03-04 06:55:15,424 INFO L175 Difference]: Start difference. First operand has 335 places, 332 transitions, 685 flow. Second operand 3 states and 1064 transitions. [2025-03-04 06:55:15,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 331 transitions, 725 flow [2025-03-04 06:55:15,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 331 transitions, 724 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:15,429 INFO L231 Difference]: Finished difference. Result has 335 places, 331 transitions, 686 flow [2025-03-04 06:55:15,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=335, PETRI_TRANSITIONS=331} [2025-03-04 06:55:15,429 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -108 predicate places. [2025-03-04 06:55:15,430 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 331 transitions, 686 flow [2025-03-04 06:55:15,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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-04 06:55:15,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:55:15,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:55:15,431 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:15,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:15,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1186142413, now seen corresponding path program 1 times [2025-03-04 06:55:15,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:15,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969356342] [2025-03-04 06:55:15,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:15,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:15,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 06:55:15,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 06:55:15,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:15,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:15,466 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-04 06:55:15,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:15,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969356342] [2025-03-04 06:55:15,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969356342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:15,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:15,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:15,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786864577] [2025-03-04 06:55:15,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:15,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:15,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:15,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:15,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:15,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 468 [2025-03-04 06:55:15,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 331 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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-04 06:55:15,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:15,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 468 [2025-03-04 06:55:15,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:15,629 INFO L124 PetriNetUnfolderBase]: 221/997 cut-off events. [2025-03-04 06:55:15,629 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-03-04 06:55:15,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1444 conditions, 997 events. 221/997 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4885 event pairs, 138 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1381. Up to 338 conditions per place. [2025-03-04 06:55:15,634 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 20 selfloop transitions, 2 changer transitions 0/330 dead transitions. [2025-03-04 06:55:15,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 330 transitions, 728 flow [2025-03-04 06:55:15,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:15,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:15,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2025-03-04 06:55:15,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7564102564102564 [2025-03-04 06:55:15,637 INFO L175 Difference]: Start difference. First operand has 335 places, 331 transitions, 686 flow. Second operand 3 states and 1062 transitions. [2025-03-04 06:55:15,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 330 transitions, 728 flow [2025-03-04 06:55:15,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 330 transitions, 724 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:15,640 INFO L231 Difference]: Finished difference. Result has 334 places, 330 transitions, 684 flow [2025-03-04 06:55:15,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=334, PETRI_TRANSITIONS=330} [2025-03-04 06:55:15,641 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -109 predicate places. [2025-03-04 06:55:15,641 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 330 transitions, 684 flow [2025-03-04 06:55:15,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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-04 06:55:15,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:15,642 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] [2025-03-04 06:55:15,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:55:15,643 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:15,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:15,643 INFO L85 PathProgramCache]: Analyzing trace with hash -257707201, now seen corresponding path program 1 times [2025-03-04 06:55:15,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:15,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395479737] [2025-03-04 06:55:15,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:15,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:15,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 06:55:15,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 06:55:15,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:15,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:15,683 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-04 06:55:15,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:15,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395479737] [2025-03-04 06:55:15,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395479737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:15,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:15,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:15,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817429363] [2025-03-04 06:55:15,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:15,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:15,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:15,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:15,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:15,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 468 [2025-03-04 06:55:15,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 330 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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-04 06:55:15,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:15,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 468 [2025-03-04 06:55:15,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:15,853 INFO L124 PetriNetUnfolderBase]: 223/1027 cut-off events. [2025-03-04 06:55:15,853 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2025-03-04 06:55:15,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1492 conditions, 1027 events. 223/1027 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5029 event pairs, 32 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1430. Up to 253 conditions per place. [2025-03-04 06:55:15,858 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 30 selfloop transitions, 2 changer transitions 0/342 dead transitions. [2025-03-04 06:55:15,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 342 transitions, 784 flow [2025-03-04 06:55:15,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:15,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1082 transitions. [2025-03-04 06:55:15,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7706552706552706 [2025-03-04 06:55:15,861 INFO L175 Difference]: Start difference. First operand has 334 places, 330 transitions, 684 flow. Second operand 3 states and 1082 transitions. [2025-03-04 06:55:15,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 342 transitions, 784 flow [2025-03-04 06:55:15,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 342 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:15,866 INFO L231 Difference]: Finished difference. Result has 334 places, 330 transitions, 688 flow [2025-03-04 06:55:15,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=334, PETRI_TRANSITIONS=330} [2025-03-04 06:55:15,866 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -109 predicate places. [2025-03-04 06:55:15,867 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 330 transitions, 688 flow [2025-03-04 06:55:15,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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-04 06:55:15,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:15,868 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] [2025-03-04 06:55:15,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:55:15,868 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:15,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:15,869 INFO L85 PathProgramCache]: Analyzing trace with hash -939386680, now seen corresponding path program 1 times [2025-03-04 06:55:15,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:15,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900017418] [2025-03-04 06:55:15,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:15,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:15,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 06:55:15,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 06:55:15,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:15,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:15,911 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-04 06:55:15,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:15,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900017418] [2025-03-04 06:55:15,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900017418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:15,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:15,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:15,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292316515] [2025-03-04 06:55:15,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:15,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:15,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:15,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:15,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:15,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 468 [2025-03-04 06:55:15,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 330 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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-04 06:55:15,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:15,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 468 [2025-03-04 06:55:15,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:16,082 INFO L124 PetriNetUnfolderBase]: 223/1042 cut-off events. [2025-03-04 06:55:16,082 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2025-03-04 06:55:16,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1608 conditions, 1042 events. 223/1042 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5266 event pairs, 146 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 1544. Up to 352 conditions per place. [2025-03-04 06:55:16,086 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 20 selfloop transitions, 2 changer transitions 0/329 dead transitions. [2025-03-04 06:55:16,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 329 transitions, 730 flow [2025-03-04 06:55:16,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:16,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-03-04 06:55:16,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7578347578347578 [2025-03-04 06:55:16,088 INFO L175 Difference]: Start difference. First operand has 334 places, 330 transitions, 688 flow. Second operand 3 states and 1064 transitions. [2025-03-04 06:55:16,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 329 transitions, 730 flow [2025-03-04 06:55:16,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 329 transitions, 728 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:16,091 INFO L231 Difference]: Finished difference. Result has 334 places, 329 transitions, 688 flow [2025-03-04 06:55:16,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=334, PETRI_TRANSITIONS=329} [2025-03-04 06:55:16,092 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -109 predicate places. [2025-03-04 06:55:16,092 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 329 transitions, 688 flow [2025-03-04 06:55:16,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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-04 06:55:16,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:16,092 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] [2025-03-04 06:55:16,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:55:16,092 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:16,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:16,093 INFO L85 PathProgramCache]: Analyzing trace with hash 879449288, now seen corresponding path program 1 times [2025-03-04 06:55:16,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:16,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157333914] [2025-03-04 06:55:16,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:16,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:16,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 06:55:16,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 06:55:16,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:16,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:16,133 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-04 06:55:16,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:16,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157333914] [2025-03-04 06:55:16,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157333914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:16,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:16,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:16,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198361123] [2025-03-04 06:55:16,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:16,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:16,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:16,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:16,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:16,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 468 [2025-03-04 06:55:16,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 329 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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-04 06:55:16,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:16,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 468 [2025-03-04 06:55:16,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:16,296 INFO L124 PetriNetUnfolderBase]: 223/1041 cut-off events. [2025-03-04 06:55:16,296 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-04 06:55:16,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1577 conditions, 1041 events. 223/1041 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5265 event pairs, 146 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 1513. Up to 353 conditions per place. [2025-03-04 06:55:16,301 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 21 selfloop transitions, 2 changer transitions 0/328 dead transitions. [2025-03-04 06:55:16,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 328 transitions, 732 flow [2025-03-04 06:55:16,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2025-03-04 06:55:16,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7564102564102564 [2025-03-04 06:55:16,304 INFO L175 Difference]: Start difference. First operand has 334 places, 329 transitions, 688 flow. Second operand 3 states and 1062 transitions. [2025-03-04 06:55:16,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 328 transitions, 732 flow [2025-03-04 06:55:16,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 328 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:16,307 INFO L231 Difference]: Finished difference. Result has 333 places, 328 transitions, 686 flow [2025-03-04 06:55:16,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=333, PETRI_TRANSITIONS=328} [2025-03-04 06:55:16,308 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -110 predicate places. [2025-03-04 06:55:16,308 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 328 transitions, 686 flow [2025-03-04 06:55:16,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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-04 06:55:16,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:16,309 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] [2025-03-04 06:55:16,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:55:16,309 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:16,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:16,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1264357818, now seen corresponding path program 1 times [2025-03-04 06:55:16,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:16,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596990152] [2025-03-04 06:55:16,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:16,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:16,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 06:55:16,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 06:55:16,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:16,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:16,343 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-04 06:55:16,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:16,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596990152] [2025-03-04 06:55:16,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596990152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:16,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:16,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:16,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092616606] [2025-03-04 06:55:16,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:16,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:16,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:16,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:16,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:16,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 468 [2025-03-04 06:55:16,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 328 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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-04 06:55:16,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:16,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 468 [2025-03-04 06:55:16,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:16,484 INFO L124 PetriNetUnfolderBase]: 223/1040 cut-off events. [2025-03-04 06:55:16,484 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2025-03-04 06:55:16,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1573 conditions, 1040 events. 223/1040 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5271 event pairs, 146 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 1510. Up to 350 conditions per place. [2025-03-04 06:55:16,488 INFO L140 encePairwiseOnDemand]: 466/468 looper letters, 19 selfloop transitions, 1 changer transitions 0/327 dead transitions. [2025-03-04 06:55:16,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 327 transitions, 724 flow [2025-03-04 06:55:16,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:16,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1071 transitions. [2025-03-04 06:55:16,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7628205128205128 [2025-03-04 06:55:16,490 INFO L175 Difference]: Start difference. First operand has 333 places, 328 transitions, 686 flow. Second operand 3 states and 1071 transitions. [2025-03-04 06:55:16,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 327 transitions, 724 flow [2025-03-04 06:55:16,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 327 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:16,493 INFO L231 Difference]: Finished difference. Result has 332 places, 327 transitions, 682 flow [2025-03-04 06:55:16,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=332, PETRI_TRANSITIONS=327} [2025-03-04 06:55:16,493 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -111 predicate places. [2025-03-04 06:55:16,493 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 327 transitions, 682 flow [2025-03-04 06:55:16,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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-04 06:55:16,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:16,494 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] [2025-03-04 06:55:16,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:55:16,494 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:16,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:16,495 INFO L85 PathProgramCache]: Analyzing trace with hash -940447622, now seen corresponding path program 1 times [2025-03-04 06:55:16,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:16,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970015744] [2025-03-04 06:55:16,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:16,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:16,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-04 06:55:16,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 06:55:16,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:16,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:16,542 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-04 06:55:16,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:16,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970015744] [2025-03-04 06:55:16,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970015744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:16,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:16,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:16,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304599353] [2025-03-04 06:55:16,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:16,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:16,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:16,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:16,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:16,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 468 [2025-03-04 06:55:16,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 327 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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-04 06:55:16,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:16,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 468 [2025-03-04 06:55:16,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:16,694 INFO L124 PetriNetUnfolderBase]: 223/1039 cut-off events. [2025-03-04 06:55:16,694 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-04 06:55:16,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1573 conditions, 1039 events. 223/1039 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5268 event pairs, 146 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 1509. Up to 352 conditions per place. [2025-03-04 06:55:16,699 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 20 selfloop transitions, 2 changer transitions 0/326 dead transitions. [2025-03-04 06:55:16,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 326 transitions, 724 flow [2025-03-04 06:55:16,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:16,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:16,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-03-04 06:55:16,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7578347578347578 [2025-03-04 06:55:16,701 INFO L175 Difference]: Start difference. First operand has 332 places, 327 transitions, 682 flow. Second operand 3 states and 1064 transitions. [2025-03-04 06:55:16,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 326 transitions, 724 flow [2025-03-04 06:55:16,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 326 transitions, 723 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:16,705 INFO L231 Difference]: Finished difference. Result has 332 places, 326 transitions, 683 flow [2025-03-04 06:55:16,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=683, PETRI_PLACES=332, PETRI_TRANSITIONS=326} [2025-03-04 06:55:16,706 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -111 predicate places. [2025-03-04 06:55:16,706 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 326 transitions, 683 flow [2025-03-04 06:55:16,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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-04 06:55:16,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:16,707 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] [2025-03-04 06:55:16,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:55:16,707 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:16,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:16,709 INFO L85 PathProgramCache]: Analyzing trace with hash 369917166, now seen corresponding path program 1 times [2025-03-04 06:55:16,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:16,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653480139] [2025-03-04 06:55:16,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:16,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:16,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-04 06:55:16,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-04 06:55:16,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:16,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:16,772 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-04 06:55:16,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:16,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653480139] [2025-03-04 06:55:16,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653480139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:16,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:16,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:16,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290870358] [2025-03-04 06:55:16,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:16,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:16,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:16,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:16,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:16,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 468 [2025-03-04 06:55:16,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 326 transitions, 683 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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-04 06:55:16,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:16,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 468 [2025-03-04 06:55:16,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:16,976 INFO L124 PetriNetUnfolderBase]: 223/1038 cut-off events. [2025-03-04 06:55:16,976 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-04 06:55:16,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 1038 events. 223/1038 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5266 event pairs, 146 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 1510. Up to 352 conditions per place. [2025-03-04 06:55:16,982 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 20 selfloop transitions, 2 changer transitions 0/325 dead transitions. [2025-03-04 06:55:16,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 325 transitions, 725 flow [2025-03-04 06:55:16,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-03-04 06:55:16,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7578347578347578 [2025-03-04 06:55:16,984 INFO L175 Difference]: Start difference. First operand has 332 places, 326 transitions, 683 flow. Second operand 3 states and 1064 transitions. [2025-03-04 06:55:16,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 325 transitions, 725 flow [2025-03-04 06:55:16,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 325 transitions, 721 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:16,989 INFO L231 Difference]: Finished difference. Result has 331 places, 325 transitions, 681 flow [2025-03-04 06:55:16,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=681, PETRI_PLACES=331, PETRI_TRANSITIONS=325} [2025-03-04 06:55:16,989 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -112 predicate places. [2025-03-04 06:55:16,989 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 325 transitions, 681 flow [2025-03-04 06:55:16,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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-04 06:55:16,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:16,990 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] [2025-03-04 06:55:16,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:55:16,990 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:16,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:16,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1184684846, now seen corresponding path program 1 times [2025-03-04 06:55:16,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:16,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303075874] [2025-03-04 06:55:16,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:16,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:17,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-04 06:55:17,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-04 06:55:17,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:17,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:17,041 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-04 06:55:17,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:17,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303075874] [2025-03-04 06:55:17,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303075874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:17,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:17,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:17,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438944427] [2025-03-04 06:55:17,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:17,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:17,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:17,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:17,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:17,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 468 [2025-03-04 06:55:17,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 325 transitions, 681 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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-04 06:55:17,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:17,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 468 [2025-03-04 06:55:17,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:17,201 INFO L124 PetriNetUnfolderBase]: 223/1037 cut-off events. [2025-03-04 06:55:17,201 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-04 06:55:17,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1573 conditions, 1037 events. 223/1037 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5265 event pairs, 146 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 1509. Up to 352 conditions per place. [2025-03-04 06:55:17,206 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 20 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2025-03-04 06:55:17,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 324 transitions, 723 flow [2025-03-04 06:55:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-03-04 06:55:17,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7578347578347578 [2025-03-04 06:55:17,208 INFO L175 Difference]: Start difference. First operand has 331 places, 325 transitions, 681 flow. Second operand 3 states and 1064 transitions. [2025-03-04 06:55:17,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 324 transitions, 723 flow [2025-03-04 06:55:17,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 324 transitions, 719 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:17,212 INFO L231 Difference]: Finished difference. Result has 330 places, 324 transitions, 679 flow [2025-03-04 06:55:17,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=330, PETRI_TRANSITIONS=324} [2025-03-04 06:55:17,212 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -113 predicate places. [2025-03-04 06:55:17,212 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 324 transitions, 679 flow [2025-03-04 06:55:17,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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-04 06:55:17,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:17,213 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:17,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 06:55:17,213 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-04 06:55:17,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:17,214 INFO L85 PathProgramCache]: Analyzing trace with hash 646303397, now seen corresponding path program 1 times [2025-03-04 06:55:17,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:17,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787366047] [2025-03-04 06:55:17,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:17,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:17,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-04 06:55:17,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-04 06:55:17,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:17,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:17,272 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-04 06:55:17,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:17,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787366047] [2025-03-04 06:55:17,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787366047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:17,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:17,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:17,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365688692] [2025-03-04 06:55:17,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:17,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:17,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:17,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:17,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:17,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 468 [2025-03-04 06:55:17,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 324 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 354.0) internal successors, (1062), 3 states have internal predecessors, (1062), 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-04 06:55:17,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:17,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 468 [2025-03-04 06:55:17,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:17,441 INFO L124 PetriNetUnfolderBase]: 223/1029 cut-off events. [2025-03-04 06:55:17,441 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-04 06:55:17,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1569 conditions, 1029 events. 223/1029 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5194 event pairs, 146 based on Foata normal form. 8/975 useless extension candidates. Maximal degree in co-relation 1505. Up to 350 conditions per place. [2025-03-04 06:55:17,447 INFO L140 encePairwiseOnDemand]: 466/468 looper letters, 0 selfloop transitions, 0 changer transitions 323/323 dead transitions. [2025-03-04 06:55:17,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 323 transitions, 715 flow [2025-03-04 06:55:17,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:17,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1070 transitions. [2025-03-04 06:55:17,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7621082621082621 [2025-03-04 06:55:17,450 INFO L175 Difference]: Start difference. First operand has 330 places, 324 transitions, 679 flow. Second operand 3 states and 1070 transitions. [2025-03-04 06:55:17,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 323 transitions, 715 flow [2025-03-04 06:55:17,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 323 transitions, 711 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:17,453 INFO L231 Difference]: Finished difference. Result has 329 places, 0 transitions, 0 flow [2025-03-04 06:55:17,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=329, PETRI_TRANSITIONS=0} [2025-03-04 06:55:17,453 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -114 predicate places. [2025-03-04 06:55:17,454 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 0 transitions, 0 flow [2025-03-04 06:55:17,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 354.0) internal successors, (1062), 3 states have internal predecessors, (1062), 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-04 06:55:17,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (203 of 204 remaining) [2025-03-04 06:55:17,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (202 of 204 remaining) [2025-03-04 06:55:17,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (201 of 204 remaining) [2025-03-04 06:55:17,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (200 of 204 remaining) [2025-03-04 06:55:17,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (199 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (198 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (197 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (196 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (195 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (194 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (193 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (192 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (191 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (190 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (189 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (188 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (187 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (186 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (185 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (184 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (183 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (182 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (181 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (180 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (179 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (178 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (177 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (176 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (175 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (174 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (173 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (172 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (171 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (170 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (169 of 204 remaining) [2025-03-04 06:55:17,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (168 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (167 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (166 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (165 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (164 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (163 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (162 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (161 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (160 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (159 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (158 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (157 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (156 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (155 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (154 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (153 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (152 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (151 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (150 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (149 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (148 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (147 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (146 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (145 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (144 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (143 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (142 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (141 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (140 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (139 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (138 of 204 remaining) [2025-03-04 06:55:17,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (137 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (136 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (135 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (134 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (133 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (132 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (131 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (130 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (129 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (128 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (127 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (126 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (125 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (124 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (123 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (122 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (121 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (120 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (119 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (118 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (117 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (116 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (115 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (114 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (113 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (112 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (111 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (110 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (109 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (108 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (107 of 204 remaining) [2025-03-04 06:55:17,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (106 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (105 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (104 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (103 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (102 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (101 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (100 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (99 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (98 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (97 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (96 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (95 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (94 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (93 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (92 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (91 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (89 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (88 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (87 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (86 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (85 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (84 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (83 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (82 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (81 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (80 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (79 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (78 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (77 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (76 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (75 of 204 remaining) [2025-03-04 06:55:17,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (74 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (73 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (72 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (71 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (70 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (69 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (68 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (67 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (66 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (65 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (64 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (63 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (62 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (61 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (60 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (59 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (58 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (57 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (56 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (55 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (54 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (53 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (52 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (51 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (50 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (49 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (48 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (47 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (46 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (45 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (44 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (43 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (42 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (41 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (40 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (39 of 204 remaining) [2025-03-04 06:55:17,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (38 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (37 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (36 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (35 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (34 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (33 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (32 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (31 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (30 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (29 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (28 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (27 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (26 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (25 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (24 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (22 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (21 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (20 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (19 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (18 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (17 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (15 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (14 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 204 remaining) [2025-03-04 06:55:17,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 204 remaining) [2025-03-04 06:55:17,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 204 remaining) [2025-03-04 06:55:17,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 204 remaining) [2025-03-04 06:55:17,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 204 remaining) [2025-03-04 06:55:17,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 204 remaining) [2025-03-04 06:55:17,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 204 remaining) [2025-03-04 06:55:17,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 204 remaining) [2025-03-04 06:55:17,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 06:55:17,463 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] [2025-03-04 06:55:17,467 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:55:17,467 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:55:17,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:55:17 BasicIcfg [2025-03-04 06:55:17,472 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:55:17,472 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:55:17,472 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:55:17,473 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:55:17,473 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:55:10" (3/4) ... [2025-03-04 06:55:17,474 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:55:17,476 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:55:17,476 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:55:17,476 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 06:55:17,481 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-03-04 06:55:17,481 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:55:17,481 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:55:17,482 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:55:17,556 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:55:17,557 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:55:17,557 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:55:17,558 INFO L158 Benchmark]: Toolchain (without parser) took 8469.08ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 112.7MB in the beginning and 476.1MB in the end (delta: -363.4MB). Peak memory consumption was 113.6MB. Max. memory is 16.1GB. [2025-03-04 06:55:17,558 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:17,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.04ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 98.0MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 06:55:17,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.47ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 93.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:17,559 INFO L158 Benchmark]: Boogie Preprocessor took 49.54ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 90.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:17,559 INFO L158 Benchmark]: IcfgBuilder took 1371.79ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 101.4MB in the end (delta: -10.7MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2025-03-04 06:55:17,559 INFO L158 Benchmark]: TraceAbstraction took 6639.63ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 100.3MB in the beginning and 484.5MB in the end (delta: -384.1MB). Peak memory consumption was 371.8MB. Max. memory is 16.1GB. [2025-03-04 06:55:17,559 INFO L158 Benchmark]: Witness Printer took 84.34ms. Allocated memory is still 620.8MB. Free memory was 484.5MB in the beginning and 476.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:55:17,560 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.04ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 98.0MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.47ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 93.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.54ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 90.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1371.79ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 101.4MB in the end (delta: -10.7MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6639.63ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 100.3MB in the beginning and 484.5MB in the end (delta: -384.1MB). Peak memory consumption was 371.8MB. Max. memory is 16.1GB. * Witness Printer took 84.34ms. Allocated memory is still 620.8MB. Free memory was 484.5MB in the beginning and 476.1MB 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: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: 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: 65]: 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: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: 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: 67]: 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: 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: 72]: 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: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: 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: 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: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: 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: 103]: 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: 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: 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: 108]: 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: 108]: 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: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: 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 - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: 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: 129]: 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 - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: 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: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: 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 - PositiveResult [Line: 134]: 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: 147]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 579 locations, 204 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: 6.5s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 452 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 172 mSDsluCounter, 159 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1061 IncrementalHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 159 mSDtfsCounter, 1061 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=914occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2788 NumberOfCodeBlocks, 2788 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2765 ConstructedInterpolants, 0 QuantifiedInterpolants, 2924 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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 113 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:55:17,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE