./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:36:58,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:36:58,647 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:36:58,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:36:58,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:36:58,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:36:58,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:36:58,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:36:58,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:36:58,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:36:58,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:36:58,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:36:58,667 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:36:58,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:36:58,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:36:58,667 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:36:58,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:36:58,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:36:58,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:36:58,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:36:58,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:36:58,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:36:58,668 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:36:58,668 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:36:58,668 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:36:58,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:36:58,668 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:36:58,668 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:36:58,668 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:36:58,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:36:58,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:36:58,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:36:58,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:36:58,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:36:58,669 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:36:58,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:36:58,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:36:58,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:36:58,669 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:36:58,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:36:58,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:36:58,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:36:58,670 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-jdk21/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 -> df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 [2025-02-08 05:36:58,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:36:58,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:36:58,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:36:58,898 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:36:58,898 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:36:58,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2025-02-08 05:37:00,027 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3ac3e873/5180e756318d4c2e923c552d578b2e82/FLAG61598d8ae [2025-02-08 05:37:00,283 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:00,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2025-02-08 05:37:00,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3ac3e873/5180e756318d4c2e923c552d578b2e82/FLAG61598d8ae [2025-02-08 05:37:00,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3ac3e873/5180e756318d4c2e923c552d578b2e82 [2025-02-08 05:37:00,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:00,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:00,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:00,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:00,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:00,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:00,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf8b581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00, skipping insertion in model container [2025-02-08 05:37:00,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:00,389 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:00,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:00,542 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:00,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:00,589 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:00,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00 WrapperNode [2025-02-08 05:37:00,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:00,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:00,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:00,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:00,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:00,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:00,625 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 213 [2025-02-08 05:37:00,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:00,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:00,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:00,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:00,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:00,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:00,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:00,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:00,647 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:00,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:00,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:00,653 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:00,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:00,663 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:00,663 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:00,663 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:00,664 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:00,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:00,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:00,711 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:37:00,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:37:00,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:00,738 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:00,738 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:00,738 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:00,738 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:00,738 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:37:00,739 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:37:00,739 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 05:37:00,739 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 05:37:00,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:00,740 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-02-08 05:37:00,740 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-02-08 05:37:00,740 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-02-08 05:37:00,740 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-02-08 05:37:00,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:00,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:00,741 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:37:00,811 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:00,812 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:01,171 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:01,172 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:01,185 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:01,185 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:01,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:01 BoogieIcfgContainer [2025-02-08 05:37:01,188 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:01,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:01,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:01,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:01,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:00" (1/3) ... [2025-02-08 05:37:01,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c986175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:01, skipping insertion in model container [2025-02-08 05:37:01,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (2/3) ... [2025-02-08 05:37:01,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c986175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:01, skipping insertion in model container [2025-02-08 05:37:01,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:01" (3/3) ... [2025-02-08 05:37:01,197 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2025-02-08 05:37:01,210 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:01,211 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp3x3-opt.wvr.c that has 7 procedures, 392 locations, 1 initial locations, 6 loop locations, and 61 error locations. [2025-02-08 05:37:01,211 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:01,315 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-02-08 05:37:01,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 410 places, 415 transitions, 872 flow [2025-02-08 05:37:01,473 INFO L124 PetriNetUnfolderBase]: 24/409 cut-off events. [2025-02-08 05:37:01,475 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:01,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 409 events. 24/409 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 863 event pairs, 0 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2025-02-08 05:37:01,485 INFO L82 GeneralOperation]: Start removeDead. Operand has 410 places, 415 transitions, 872 flow [2025-02-08 05:37:01,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 379 places, 382 transitions, 800 flow [2025-02-08 05:37:01,507 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:01,519 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;@7444747c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:01,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 97 error locations. [2025-02-08 05:37:01,527 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:01,529 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-02-08 05:37:01,529 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:01,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:01,530 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:01,530 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-02-08 05:37:01,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:01,536 INFO L85 PathProgramCache]: Analyzing trace with hash -752881185, now seen corresponding path program 1 times [2025-02-08 05:37:01,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:01,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258058880] [2025-02-08 05:37:01,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:01,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:01,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:37:01,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:37:01,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:01,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:01,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:01,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:01,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258058880] [2025-02-08 05:37:01,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258058880] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:01,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:01,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:01,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666647062] [2025-02-08 05:37:01,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:01,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:01,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:01,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:01,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:01,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2025-02-08 05:37:01,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 382 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-02-08 05:37:01,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:01,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2025-02-08 05:37:01,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:01,928 INFO L124 PetriNetUnfolderBase]: 40/509 cut-off events. [2025-02-08 05:37:01,928 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-02-08 05:37:01,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 509 events. 40/509 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1853 event pairs, 20 based on Foata normal form. 91/490 useless extension candidates. Maximal degree in co-relation 460. Up to 68 conditions per place. [2025-02-08 05:37:01,937 INFO L140 encePairwiseOnDemand]: 405/415 looper letters, 22 selfloop transitions, 2 changer transitions 1/374 dead transitions. [2025-02-08 05:37:01,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 374 transitions, 832 flow [2025-02-08 05:37:01,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:01,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-02-08 05:37:01,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-02-08 05:37:01,956 INFO L175 Difference]: Start difference. First operand has 379 places, 382 transitions, 800 flow. Second operand 3 states and 1172 transitions. [2025-02-08 05:37:01,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 374 transitions, 832 flow [2025-02-08 05:37:01,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 374 transitions, 808 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-02-08 05:37:01,968 INFO L231 Difference]: Finished difference. Result has 368 places, 373 transitions, 762 flow [2025-02-08 05:37:01,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=368, PETRI_TRANSITIONS=373} [2025-02-08 05:37:01,972 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -11 predicate places. [2025-02-08 05:37:01,972 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 373 transitions, 762 flow [2025-02-08 05:37:01,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-02-08 05:37:01,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:01,973 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:01,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:01,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-02-08 05:37:01,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:01,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1687948074, now seen corresponding path program 1 times [2025-02-08 05:37:01,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:01,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971071333] [2025-02-08 05:37:01,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:01,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:01,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 05:37:01,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 05:37:01,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:01,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:02,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971071333] [2025-02-08 05:37:02,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971071333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:02,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932679040] [2025-02-08 05:37:02,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:02,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:02,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:02,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2025-02-08 05:37:02,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 373 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-02-08 05:37:02,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2025-02-08 05:37:02,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:02,140 INFO L124 PetriNetUnfolderBase]: 40/507 cut-off events. [2025-02-08 05:37:02,140 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:02,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 507 events. 40/507 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1765 event pairs, 20 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 569. Up to 68 conditions per place. [2025-02-08 05:37:02,145 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2025-02-08 05:37:02,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 372 transitions, 808 flow [2025-02-08 05:37:02,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:02,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-02-08 05:37:02,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2025-02-08 05:37:02,148 INFO L175 Difference]: Start difference. First operand has 368 places, 373 transitions, 762 flow. Second operand 3 states and 1165 transitions. [2025-02-08 05:37:02,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 372 transitions, 808 flow [2025-02-08 05:37:02,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 372 transitions, 804 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:02,154 INFO L231 Difference]: Finished difference. Result has 366 places, 372 transitions, 760 flow [2025-02-08 05:37:02,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=366, PETRI_TRANSITIONS=372} [2025-02-08 05:37:02,155 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -13 predicate places. [2025-02-08 05:37:02,155 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 372 transitions, 760 flow [2025-02-08 05:37:02,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-02-08 05:37:02,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:02,156 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:02,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:02,156 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-02-08 05:37:02,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:02,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2038966466, now seen corresponding path program 1 times [2025-02-08 05:37:02,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:02,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319912510] [2025-02-08 05:37:02,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:02,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:02,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 05:37:02,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 05:37:02,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:02,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,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-02-08 05:37:02,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319912510] [2025-02-08 05:37:02,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319912510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:02,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661786286] [2025-02-08 05:37:02,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:02,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:02,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:02,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2025-02-08 05:37:02,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 372 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-02-08 05:37:02,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2025-02-08 05:37:02,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:02,302 INFO L124 PetriNetUnfolderBase]: 40/488 cut-off events. [2025-02-08 05:37:02,302 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:37:02,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 488 events. 40/488 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1595 event pairs, 20 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 539. Up to 68 conditions per place. [2025-02-08 05:37:02,308 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2025-02-08 05:37:02,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 371 transitions, 806 flow [2025-02-08 05:37:02,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-02-08 05:37:02,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2025-02-08 05:37:02,314 INFO L175 Difference]: Start difference. First operand has 366 places, 372 transitions, 760 flow. Second operand 3 states and 1165 transitions. [2025-02-08 05:37:02,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 371 transitions, 806 flow [2025-02-08 05:37:02,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 371 transitions, 802 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:02,319 INFO L231 Difference]: Finished difference. Result has 365 places, 371 transitions, 758 flow [2025-02-08 05:37:02,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=365, PETRI_TRANSITIONS=371} [2025-02-08 05:37:02,320 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -14 predicate places. [2025-02-08 05:37:02,320 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 371 transitions, 758 flow [2025-02-08 05:37:02,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-02-08 05:37:02,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:02,321 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] [2025-02-08 05:37:02,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:02,321 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-02-08 05:37:02,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:02,321 INFO L85 PathProgramCache]: Analyzing trace with hash -211528752, now seen corresponding path program 1 times [2025-02-08 05:37:02,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:02,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848883961] [2025-02-08 05:37:02,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:02,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:02,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:37:02,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:37:02,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:02,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:02,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848883961] [2025-02-08 05:37:02,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848883961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:02,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851944685] [2025-02-08 05:37:02,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:02,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:02,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:02,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2025-02-08 05:37:02,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 371 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-02-08 05:37:02,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2025-02-08 05:37:02,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:02,484 INFO L124 PetriNetUnfolderBase]: 40/469 cut-off events. [2025-02-08 05:37:02,484 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:37:02,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 469 events. 40/469 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1380 event pairs, 20 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 509. Up to 68 conditions per place. [2025-02-08 05:37:02,488 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-02-08 05:37:02,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 370 transitions, 804 flow [2025-02-08 05:37:02,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-02-08 05:37:02,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2025-02-08 05:37:02,491 INFO L175 Difference]: Start difference. First operand has 365 places, 371 transitions, 758 flow. Second operand 3 states and 1165 transitions. [2025-02-08 05:37:02,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 370 transitions, 804 flow [2025-02-08 05:37:02,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 370 transitions, 800 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:02,497 INFO L231 Difference]: Finished difference. Result has 364 places, 370 transitions, 756 flow [2025-02-08 05:37:02,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=364, PETRI_TRANSITIONS=370} [2025-02-08 05:37:02,498 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -15 predicate places. [2025-02-08 05:37:02,498 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 370 transitions, 756 flow [2025-02-08 05:37:02,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-02-08 05:37:02,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:02,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:02,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:02,499 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-02-08 05:37:02,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:02,501 INFO L85 PathProgramCache]: Analyzing trace with hash -714279330, now seen corresponding path program 1 times [2025-02-08 05:37:02,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:02,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951160442] [2025-02-08 05:37:02,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:02,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:02,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:37:02,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:37:02,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:02,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:02,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951160442] [2025-02-08 05:37:02,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951160442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:02,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286191650] [2025-02-08 05:37:02,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:02,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:02,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:02,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2025-02-08 05:37:02,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 370 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-02-08 05:37:02,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2025-02-08 05:37:02,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:02,623 INFO L124 PetriNetUnfolderBase]: 40/450 cut-off events. [2025-02-08 05:37:02,624 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:37:02,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 450 events. 40/450 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1213 event pairs, 20 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 479. Up to 68 conditions per place. [2025-02-08 05:37:02,628 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2025-02-08 05:37:02,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 369 transitions, 802 flow [2025-02-08 05:37:02,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-02-08 05:37:02,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2025-02-08 05:37:02,630 INFO L175 Difference]: Start difference. First operand has 364 places, 370 transitions, 756 flow. Second operand 3 states and 1165 transitions. [2025-02-08 05:37:02,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 369 transitions, 802 flow [2025-02-08 05:37:02,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 369 transitions, 798 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:02,635 INFO L231 Difference]: Finished difference. Result has 363 places, 369 transitions, 754 flow [2025-02-08 05:37:02,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=363, PETRI_TRANSITIONS=369} [2025-02-08 05:37:02,635 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -16 predicate places. [2025-02-08 05:37:02,635 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 369 transitions, 754 flow [2025-02-08 05:37:02,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-02-08 05:37:02,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:02,636 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] [2025-02-08 05:37:02,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:02,637 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-02-08 05:37:02,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:02,637 INFO L85 PathProgramCache]: Analyzing trace with hash 684401521, now seen corresponding path program 1 times [2025-02-08 05:37:02,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:02,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263819050] [2025-02-08 05:37:02,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:02,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:02,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 05:37:02,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 05:37:02,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:02,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:02,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263819050] [2025-02-08 05:37:02,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263819050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:02,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271321872] [2025-02-08 05:37:02,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:02,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:02,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:02,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2025-02-08 05:37:02,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 369 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-02-08 05:37:02,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2025-02-08 05:37:02,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:02,764 INFO L124 PetriNetUnfolderBase]: 40/431 cut-off events. [2025-02-08 05:37:02,764 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:37:02,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 431 events. 40/431 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1062 event pairs, 20 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 449. Up to 68 conditions per place. [2025-02-08 05:37:02,767 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2025-02-08 05:37:02,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 368 transitions, 800 flow [2025-02-08 05:37:02,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:02,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:02,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-02-08 05:37:02,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2025-02-08 05:37:02,770 INFO L175 Difference]: Start difference. First operand has 363 places, 369 transitions, 754 flow. Second operand 3 states and 1165 transitions. [2025-02-08 05:37:02,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 368 transitions, 800 flow [2025-02-08 05:37:02,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 368 transitions, 796 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:02,774 INFO L231 Difference]: Finished difference. Result has 362 places, 368 transitions, 752 flow [2025-02-08 05:37:02,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=362, PETRI_TRANSITIONS=368} [2025-02-08 05:37:02,775 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -17 predicate places. [2025-02-08 05:37:02,775 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 368 transitions, 752 flow [2025-02-08 05:37:02,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-02-08 05:37:02,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:02,776 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] [2025-02-08 05:37:02,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:02,776 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-02-08 05:37:02,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:02,776 INFO L85 PathProgramCache]: Analyzing trace with hash 981697025, now seen corresponding path program 1 times [2025-02-08 05:37:02,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:02,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247156230] [2025-02-08 05:37:02,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:02,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:02,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 05:37:02,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 05:37:02,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:02,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:02,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247156230] [2025-02-08 05:37:02,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247156230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:02,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120907838] [2025-02-08 05:37:02,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:02,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:02,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:02,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 415 [2025-02-08 05:37:02,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 368 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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-02-08 05:37:02,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 415 [2025-02-08 05:37:02,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:03,385 INFO L124 PetriNetUnfolderBase]: 758/4767 cut-off events. [2025-02-08 05:37:03,385 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-02-08 05:37:03,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5778 conditions, 4767 events. 758/4767 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 46229 event pairs, 387 based on Foata normal form. 0/3500 useless extension candidates. Maximal degree in co-relation 5709. Up to 942 conditions per place. [2025-02-08 05:37:03,439 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 27 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2025-02-08 05:37:03,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 367 transitions, 808 flow [2025-02-08 05:37:03,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:03,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:03,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1155 transitions. [2025-02-08 05:37:03,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.927710843373494 [2025-02-08 05:37:03,441 INFO L175 Difference]: Start difference. First operand has 362 places, 368 transitions, 752 flow. Second operand 3 states and 1155 transitions. [2025-02-08 05:37:03,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 367 transitions, 808 flow [2025-02-08 05:37:03,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 367 transitions, 804 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:03,447 INFO L231 Difference]: Finished difference. Result has 361 places, 367 transitions, 750 flow [2025-02-08 05:37:03,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=361, PETRI_TRANSITIONS=367} [2025-02-08 05:37:03,449 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -18 predicate places. [2025-02-08 05:37:03,449 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 367 transitions, 750 flow [2025-02-08 05:37:03,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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-02-08 05:37:03,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:03,450 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] [2025-02-08 05:37:03,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:03,451 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-02-08 05:37:03,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:03,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1784561826, now seen corresponding path program 1 times [2025-02-08 05:37:03,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:03,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40193973] [2025-02-08 05:37:03,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:03,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:03,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 05:37:03,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 05:37:03,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:03,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:03,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:03,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:03,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40193973] [2025-02-08 05:37:03,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40193973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:03,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:03,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:03,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297887907] [2025-02-08 05:37:03,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:03,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:03,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:03,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:03,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:03,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2025-02-08 05:37:03,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 367 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-02-08 05:37:03,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:03,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2025-02-08 05:37:03,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:03,586 INFO L124 PetriNetUnfolderBase]: 55/497 cut-off events. [2025-02-08 05:37:03,587 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:37:03,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 497 events. 55/497 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1885 event pairs, 30 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 569. Up to 90 conditions per place. [2025-02-08 05:37:03,591 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 29 selfloop transitions, 3 changer transitions 0/367 dead transitions. [2025-02-08 05:37:03,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 367 transitions, 819 flow [2025-02-08 05:37:03,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:03,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:03,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1160 transitions. [2025-02-08 05:37:03,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317269076305221 [2025-02-08 05:37:03,593 INFO L175 Difference]: Start difference. First operand has 361 places, 367 transitions, 750 flow. Second operand 3 states and 1160 transitions. [2025-02-08 05:37:03,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 367 transitions, 819 flow [2025-02-08 05:37:03,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 367 transitions, 815 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:03,598 INFO L231 Difference]: Finished difference. Result has 356 places, 362 transitions, 747 flow [2025-02-08 05:37:03,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=747, PETRI_PLACES=356, PETRI_TRANSITIONS=362} [2025-02-08 05:37:03,599 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -23 predicate places. [2025-02-08 05:37:03,599 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 362 transitions, 747 flow [2025-02-08 05:37:03,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-02-08 05:37:03,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:03,600 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] [2025-02-08 05:37:03,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:03,600 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-02-08 05:37:03,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:03,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1271983893, now seen corresponding path program 1 times [2025-02-08 05:37:03,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:03,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022188610] [2025-02-08 05:37:03,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:03,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:03,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 05:37:03,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 05:37:03,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:03,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:03,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:03,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022188610] [2025-02-08 05:37:03,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022188610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:03,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:03,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:03,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107915362] [2025-02-08 05:37:03,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:03,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:03,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:03,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:03,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:03,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2025-02-08 05:37:03,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 362 transitions, 747 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-02-08 05:37:03,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:03,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2025-02-08 05:37:03,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:03,730 INFO L124 PetriNetUnfolderBase]: 55/492 cut-off events. [2025-02-08 05:37:03,731 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:37:03,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 492 events. 55/492 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1788 event pairs, 30 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 552. Up to 90 conditions per place. [2025-02-08 05:37:03,734 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 29 selfloop transitions, 3 changer transitions 0/362 dead transitions. [2025-02-08 05:37:03,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 362 transitions, 816 flow [2025-02-08 05:37:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:03,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1160 transitions. [2025-02-08 05:37:03,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317269076305221 [2025-02-08 05:37:03,736 INFO L175 Difference]: Start difference. First operand has 356 places, 362 transitions, 747 flow. Second operand 3 states and 1160 transitions. [2025-02-08 05:37:03,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 362 transitions, 816 flow [2025-02-08 05:37:03,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 362 transitions, 813 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:03,740 INFO L231 Difference]: Finished difference. Result has 352 places, 357 transitions, 745 flow [2025-02-08 05:37:03,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=745, PETRI_PLACES=352, PETRI_TRANSITIONS=357} [2025-02-08 05:37:03,741 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -27 predicate places. [2025-02-08 05:37:03,741 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 357 transitions, 745 flow [2025-02-08 05:37:03,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-02-08 05:37:03,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:03,742 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] [2025-02-08 05:37:03,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:03,742 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-02-08 05:37:03,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:03,743 INFO L85 PathProgramCache]: Analyzing trace with hash 239686847, now seen corresponding path program 1 times [2025-02-08 05:37:03,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:03,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456964490] [2025-02-08 05:37:03,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:03,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:03,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:37:03,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:37:03,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:03,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:03,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:03,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456964490] [2025-02-08 05:37:03,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456964490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:03,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:03,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:03,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875934634] [2025-02-08 05:37:03,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:03,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:03,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:03,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:03,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:03,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2025-02-08 05:37:03,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 357 transitions, 745 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-02-08 05:37:03,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:03,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2025-02-08 05:37:03,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:03,899 INFO L124 PetriNetUnfolderBase]: 66/657 cut-off events. [2025-02-08 05:37:03,899 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:37:03,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 657 events. 66/657 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2881 event pairs, 5 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 729. Up to 95 conditions per place. [2025-02-08 05:37:03,904 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 32 selfloop transitions, 3 changer transitions 0/360 dead transitions. [2025-02-08 05:37:03,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 360 transitions, 829 flow [2025-02-08 05:37:03,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2025-02-08 05:37:03,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.934136546184739 [2025-02-08 05:37:03,906 INFO L175 Difference]: Start difference. First operand has 352 places, 357 transitions, 745 flow. Second operand 3 states and 1163 transitions. [2025-02-08 05:37:03,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 360 transitions, 829 flow [2025-02-08 05:37:03,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 360 transitions, 826 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:03,910 INFO L231 Difference]: Finished difference. Result has 348 places, 352 transitions, 743 flow [2025-02-08 05:37:03,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=743, PETRI_PLACES=348, PETRI_TRANSITIONS=352} [2025-02-08 05:37:03,912 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -31 predicate places. [2025-02-08 05:37:03,912 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 352 transitions, 743 flow [2025-02-08 05:37:03,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-02-08 05:37:03,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:03,912 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] [2025-02-08 05:37:03,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:03,913 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-02-08 05:37:03,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:03,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1590056954, now seen corresponding path program 1 times [2025-02-08 05:37:03,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:03,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482643965] [2025-02-08 05:37:03,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:03,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:03,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 05:37:03,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 05:37:03,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:03,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:03,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:03,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482643965] [2025-02-08 05:37:03,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482643965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:03,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:03,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:03,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546009351] [2025-02-08 05:37:03,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:03,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:03,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:03,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:03,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:03,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2025-02-08 05:37:03,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 352 transitions, 743 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-02-08 05:37:03,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:03,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2025-02-08 05:37:03,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:04,080 INFO L124 PetriNetUnfolderBase]: 105/1026 cut-off events. [2025-02-08 05:37:04,080 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-08 05:37:04,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1296 conditions, 1026 events. 105/1026 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5780 event pairs, 40 based on Foata normal form. 0/894 useless extension candidates. Maximal degree in co-relation 896. Up to 154 conditions per place. [2025-02-08 05:37:04,089 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 34 selfloop transitions, 3 changer transitions 0/357 dead transitions. [2025-02-08 05:37:04,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 357 transitions, 837 flow [2025-02-08 05:37:04,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:04,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-02-08 05:37:04,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2025-02-08 05:37:04,117 INFO L175 Difference]: Start difference. First operand has 348 places, 352 transitions, 743 flow. Second operand 3 states and 1165 transitions. [2025-02-08 05:37:04,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 357 transitions, 837 flow [2025-02-08 05:37:04,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 357 transitions, 834 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:04,126 INFO L231 Difference]: Finished difference. Result has 344 places, 347 transitions, 741 flow [2025-02-08 05:37:04,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=741, PETRI_PLACES=344, PETRI_TRANSITIONS=347} [2025-02-08 05:37:04,127 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -35 predicate places. [2025-02-08 05:37:04,127 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 347 transitions, 741 flow [2025-02-08 05:37:04,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-02-08 05:37:04,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:37:04,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:04,128 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-02-08 05:37:04,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:04,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1589156707, now seen corresponding path program 1 times [2025-02-08 05:37:04,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:04,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102333986] [2025-02-08 05:37:04,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:04,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:04,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 05:37:04,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 05:37:04,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:04,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:04,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:04,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:04,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102333986] [2025-02-08 05:37:04,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102333986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:04,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:04,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:04,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485619436] [2025-02-08 05:37:04,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:04,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:04,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:04,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:04,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:04,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2025-02-08 05:37:04,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 347 transitions, 741 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-02-08 05:37:04,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:04,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2025-02-08 05:37:04,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:04,510 INFO L124 PetriNetUnfolderBase]: 199/1421 cut-off events. [2025-02-08 05:37:04,510 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-02-08 05:37:04,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1923 conditions, 1421 events. 199/1421 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 9666 event pairs, 98 based on Foata normal form. 0/1239 useless extension candidates. Maximal degree in co-relation 1436. Up to 302 conditions per place. [2025-02-08 05:37:04,530 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 33 selfloop transitions, 3 changer transitions 0/351 dead transitions. [2025-02-08 05:37:04,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 351 transitions, 830 flow [2025-02-08 05:37:04,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:04,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:04,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1164 transitions. [2025-02-08 05:37:04,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9349397590361446 [2025-02-08 05:37:04,533 INFO L175 Difference]: Start difference. First operand has 344 places, 347 transitions, 741 flow. Second operand 3 states and 1164 transitions. [2025-02-08 05:37:04,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 351 transitions, 830 flow [2025-02-08 05:37:04,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 351 transitions, 827 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:04,540 INFO L231 Difference]: Finished difference. Result has 340 places, 342 transitions, 739 flow [2025-02-08 05:37:04,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=739, PETRI_PLACES=340, PETRI_TRANSITIONS=342} [2025-02-08 05:37:04,542 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -39 predicate places. [2025-02-08 05:37:04,543 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 342 transitions, 739 flow [2025-02-08 05:37:04,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-02-08 05:37:04,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:04,544 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] [2025-02-08 05:37:04,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:04,544 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-02-08 05:37:04,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:04,545 INFO L85 PathProgramCache]: Analyzing trace with hash 963640961, now seen corresponding path program 1 times [2025-02-08 05:37:04,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:04,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057709066] [2025-02-08 05:37:04,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:04,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:04,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 05:37:04,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 05:37:04,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:04,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:04,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:04,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:04,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057709066] [2025-02-08 05:37:04,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057709066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:04,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:04,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:04,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350945566] [2025-02-08 05:37:04,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:04,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:04,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:04,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:04,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:04,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2025-02-08 05:37:04,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 342 transitions, 739 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-02-08 05:37:04,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:04,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2025-02-08 05:37:04,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:04,806 INFO L124 PetriNetUnfolderBase]: 175/1203 cut-off events. [2025-02-08 05:37:04,806 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2025-02-08 05:37:04,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1627 conditions, 1203 events. 175/1203 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 7218 event pairs, 50 based on Foata normal form. 1/1094 useless extension candidates. Maximal degree in co-relation 920. Up to 269 conditions per place. [2025-02-08 05:37:04,819 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 33 selfloop transitions, 3 changer transitions 8/348 dead transitions. [2025-02-08 05:37:04,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 348 transitions, 836 flow [2025-02-08 05:37:04,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:04,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:04,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-02-08 05:37:04,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2025-02-08 05:37:04,822 INFO L175 Difference]: Start difference. First operand has 340 places, 342 transitions, 739 flow. Second operand 3 states and 1165 transitions. [2025-02-08 05:37:04,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 348 transitions, 836 flow [2025-02-08 05:37:04,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 348 transitions, 833 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:04,829 INFO L231 Difference]: Finished difference. Result has 336 places, 329 transitions, 721 flow [2025-02-08 05:37:04,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=721, PETRI_PLACES=336, PETRI_TRANSITIONS=329} [2025-02-08 05:37:04,830 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -43 predicate places. [2025-02-08 05:37:04,830 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 329 transitions, 721 flow [2025-02-08 05:37:04,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-02-08 05:37:04,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:04,831 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:04,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:04,832 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-02-08 05:37:04,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:04,832 INFO L85 PathProgramCache]: Analyzing trace with hash -251376277, now seen corresponding path program 1 times [2025-02-08 05:37:04,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:04,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598386593] [2025-02-08 05:37:04,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:04,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:04,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 05:37:04,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 05:37:04,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:04,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:04,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:04,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:04,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598386593] [2025-02-08 05:37:04,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598386593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:04,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:04,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:04,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969092408] [2025-02-08 05:37:04,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:04,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:04,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:04,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:04,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:04,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 415 [2025-02-08 05:37:04,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 329 transitions, 721 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-02-08 05:37:04,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:04,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 415 [2025-02-08 05:37:04,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:10,801 INFO L124 PetriNetUnfolderBase]: 17906/60994 cut-off events. [2025-02-08 05:37:10,801 INFO L125 PetriNetUnfolderBase]: For 1608/1608 co-relation queries the response was YES. [2025-02-08 05:37:11,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89458 conditions, 60994 events. 17906/60994 cut-off events. For 1608/1608 co-relation queries the response was YES. Maximal size of possible extension queue 2231. Compared 865144 event pairs, 8762 based on Foata normal form. 1/52730 useless extension candidates. Maximal degree in co-relation 34103. Up to 21614 conditions per place. [2025-02-08 05:37:11,635 INFO L140 encePairwiseOnDemand]: 397/415 looper letters, 29 selfloop transitions, 6 changer transitions 58/328 dead transitions. [2025-02-08 05:37:11,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 328 transitions, 818 flow [2025-02-08 05:37:11,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-02-08 05:37:11,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9076305220883534 [2025-02-08 05:37:11,638 INFO L175 Difference]: Start difference. First operand has 336 places, 329 transitions, 721 flow. Second operand 3 states and 1130 transitions. [2025-02-08 05:37:11,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 328 transitions, 818 flow [2025-02-08 05:37:11,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 328 transitions, 815 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:11,765 INFO L231 Difference]: Finished difference. Result has 319 places, 265 transitions, 619 flow [2025-02-08 05:37:11,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=619, PETRI_PLACES=319, PETRI_TRANSITIONS=265} [2025-02-08 05:37:11,767 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -60 predicate places. [2025-02-08 05:37:11,767 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 265 transitions, 619 flow [2025-02-08 05:37:11,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-02-08 05:37:11,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:11,768 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] [2025-02-08 05:37:11,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:11,768 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-02-08 05:37:11,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:11,768 INFO L85 PathProgramCache]: Analyzing trace with hash -23975753, now seen corresponding path program 1 times [2025-02-08 05:37:11,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:11,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077727032] [2025-02-08 05:37:11,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:11,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:11,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 05:37:11,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 05:37:11,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:11,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:11,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:11,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:11,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077727032] [2025-02-08 05:37:11,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077727032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:11,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:11,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:11,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843681042] [2025-02-08 05:37:11,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:11,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:11,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:11,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:11,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:11,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2025-02-08 05:37:11,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 265 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 385.0) internal successors, (1155), 3 states have internal predecessors, (1155), 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-02-08 05:37:11,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:11,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2025-02-08 05:37:11,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:12,606 INFO L124 PetriNetUnfolderBase]: 1604/7454 cut-off events. [2025-02-08 05:37:12,606 INFO L125 PetriNetUnfolderBase]: For 33/49 co-relation queries the response was YES. [2025-02-08 05:37:12,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10493 conditions, 7454 events. 1604/7454 cut-off events. For 33/49 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 81501 event pairs, 362 based on Foata normal form. 0/6276 useless extension candidates. Maximal degree in co-relation 5435. Up to 1748 conditions per place. [2025-02-08 05:37:12,699 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2025-02-08 05:37:12,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 269 transitions, 684 flow [2025-02-08 05:37:12,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-02-08 05:37:12,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-02-08 05:37:12,702 INFO L175 Difference]: Start difference. First operand has 319 places, 265 transitions, 619 flow. Second operand 3 states and 1172 transitions. [2025-02-08 05:37:12,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 269 transitions, 684 flow [2025-02-08 05:37:12,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 269 transitions, 684 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:12,708 INFO L231 Difference]: Finished difference. Result has 268 places, 264 transitions, 621 flow [2025-02-08 05:37:12,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=621, PETRI_PLACES=268, PETRI_TRANSITIONS=264} [2025-02-08 05:37:12,709 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -111 predicate places. [2025-02-08 05:37:12,709 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 264 transitions, 621 flow [2025-02-08 05:37:12,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.0) internal successors, (1155), 3 states have internal predecessors, (1155), 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-02-08 05:37:12,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:12,710 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] [2025-02-08 05:37:12,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:12,710 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-02-08 05:37:12,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:12,711 INFO L85 PathProgramCache]: Analyzing trace with hash -957056736, now seen corresponding path program 1 times [2025-02-08 05:37:12,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:12,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095813900] [2025-02-08 05:37:12,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:12,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:12,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 05:37:12,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 05:37:12,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:12,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:12,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:12,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:12,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095813900] [2025-02-08 05:37:12,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095813900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:12,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:12,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:12,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604451004] [2025-02-08 05:37:12,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:12,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:12,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:12,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:12,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:12,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2025-02-08 05:37:12,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 264 transitions, 621 flow. Second operand has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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-02-08 05:37:12,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:12,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2025-02-08 05:37:12,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:14,431 INFO L124 PetriNetUnfolderBase]: 2799/12329 cut-off events. [2025-02-08 05:37:14,432 INFO L125 PetriNetUnfolderBase]: For 249/265 co-relation queries the response was YES. [2025-02-08 05:37:14,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17886 conditions, 12329 events. 2799/12329 cut-off events. For 249/265 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 147643 event pairs, 798 based on Foata normal form. 0/10687 useless extension candidates. Maximal degree in co-relation 17286. Up to 2661 conditions per place. [2025-02-08 05:37:14,652 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2025-02-08 05:37:14,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 268 transitions, 686 flow [2025-02-08 05:37:14,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:14,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-02-08 05:37:14,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-02-08 05:37:14,656 INFO L175 Difference]: Start difference. First operand has 268 places, 264 transitions, 621 flow. Second operand 3 states and 1172 transitions. [2025-02-08 05:37:14,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 268 transitions, 686 flow [2025-02-08 05:37:14,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 268 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:14,672 INFO L231 Difference]: Finished difference. Result has 267 places, 263 transitions, 619 flow [2025-02-08 05:37:14,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=619, PETRI_PLACES=267, PETRI_TRANSITIONS=263} [2025-02-08 05:37:14,673 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -112 predicate places. [2025-02-08 05:37:14,673 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 263 transitions, 619 flow [2025-02-08 05:37:14,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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-02-08 05:37:14,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:14,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:14,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:37:14,680 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-02-08 05:37:14,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:14,680 INFO L85 PathProgramCache]: Analyzing trace with hash 621906003, now seen corresponding path program 1 times [2025-02-08 05:37:14,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:14,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097622560] [2025-02-08 05:37:14,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:14,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:14,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 05:37:14,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 05:37:14,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:14,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:14,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:14,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097622560] [2025-02-08 05:37:14,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097622560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:14,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:14,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:14,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106502313] [2025-02-08 05:37:14,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:14,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:14,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:14,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:14,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:14,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2025-02-08 05:37:14,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 263 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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-02-08 05:37:14,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:14,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2025-02-08 05:37:14,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:15,366 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [281#L107-1true, 368#L41-2true, Black: 450#true, 63#thread2ENTRYtrue, 465#true, 454#true, 174#L57-2true, 219#L65-2true, Black: 458#true, 460#(= |#race~n~0| 0), Black: 434#true, 236#thread5ENTRYtrue, Black: 438#true, 468#true, Black: 442#true, 446#true]) [2025-02-08 05:37:15,366 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2025-02-08 05:37:15,366 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-02-08 05:37:15,366 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-08 05:37:15,366 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:37:15,367 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [281#L107-1true, 368#L41-2true, Black: 446#true, 323#L73-2true, Black: 450#true, 63#thread2ENTRYtrue, 465#true, 454#true, 219#L65-2true, 174#L57-2true, Black: 458#true, 460#(= |#race~n~0| 0), Black: 434#true, Black: 438#true, 468#true, Black: 442#true]) [2025-02-08 05:37:15,367 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-02-08 05:37:15,367 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-02-08 05:37:15,367 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-02-08 05:37:15,367 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-02-08 05:37:15,374 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [281#L107-1true, Black: 450#true, 465#true, 454#true, 219#L65-2true, 174#L57-2true, Black: 458#true, 460#(= |#race~n~0| 0), 69#L49-2true, 211#thread1ENTRYtrue, Black: 434#true, 236#thread5ENTRYtrue, Black: 438#true, 468#true, Black: 442#true, 446#true]) [2025-02-08 05:37:15,374 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2025-02-08 05:37:15,374 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-08 05:37:15,374 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:37:15,374 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-02-08 05:37:15,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [281#L107-1true, Black: 446#true, 323#L73-2true, Black: 450#true, 465#true, 454#true, 219#L65-2true, 174#L57-2true, Black: 458#true, 460#(= |#race~n~0| 0), 69#L49-2true, 211#thread1ENTRYtrue, Black: 434#true, Black: 438#true, 468#true, Black: 442#true]) [2025-02-08 05:37:15,375 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-02-08 05:37:15,375 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-02-08 05:37:15,375 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-02-08 05:37:15,375 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-02-08 05:37:15,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [281#L107-1true, 368#L41-2true, Black: 450#true, 465#true, 454#true, 219#L65-2true, 174#L57-2true, Black: 458#true, 69#L49-2true, 460#(= |#race~n~0| 0), Black: 434#true, 236#thread5ENTRYtrue, Black: 438#true, 468#true, Black: 442#true, 446#true]) [2025-02-08 05:37:15,574 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-02-08 05:37:15,574 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-02-08 05:37:15,574 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-02-08 05:37:15,574 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-02-08 05:37:15,575 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [281#L107-1true, 368#L41-2true, Black: 446#true, 323#L73-2true, Black: 450#true, 465#true, 454#true, 174#L57-2true, Black: 458#true, 219#L65-2true, 460#(= |#race~n~0| 0), 69#L49-2true, Black: 434#true, Black: 438#true, 468#true, Black: 442#true]) [2025-02-08 05:37:15,575 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2025-02-08 05:37:15,575 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-02-08 05:37:15,575 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-02-08 05:37:15,575 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-02-08 05:37:15,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [281#L107-1true, Black: 446#true, 368#L41-2true, Black: 450#true, 63#thread2ENTRYtrue, Black: 454#true, 465#true, 219#L65-2true, 174#L57-2true, Black: 458#true, 460#(= |#race~n~0| 0), Black: 434#true, 236#thread5ENTRYtrue, Black: 438#true, 468#true, Black: 442#true]) [2025-02-08 05:37:15,615 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2025-02-08 05:37:15,615 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-02-08 05:37:15,615 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-02-08 05:37:15,615 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-08 05:37:15,616 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [281#L107-1true, 368#L41-2true, Black: 446#true, 323#L73-2true, Black: 450#true, 63#thread2ENTRYtrue, Black: 454#true, 465#true, 174#L57-2true, Black: 458#true, 219#L65-2true, 460#(= |#race~n~0| 0), Black: 434#true, Black: 438#true, 468#true, Black: 442#true]) [2025-02-08 05:37:15,616 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2025-02-08 05:37:15,616 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-02-08 05:37:15,616 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-08 05:37:15,616 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-02-08 05:37:15,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [281#L107-1true, Black: 446#true, Black: 450#true, Black: 454#true, 465#true, 219#L65-2true, 174#L57-2true, Black: 458#true, 211#thread1ENTRYtrue, 460#(= |#race~n~0| 0), 69#L49-2true, Black: 434#true, 236#thread5ENTRYtrue, Black: 438#true, 468#true, Black: 442#true]) [2025-02-08 05:37:15,620 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2025-02-08 05:37:15,620 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-02-08 05:37:15,620 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-02-08 05:37:15,620 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-08 05:37:15,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [281#L107-1true, Black: 446#true, 323#L73-2true, Black: 450#true, Black: 454#true, 465#true, 219#L65-2true, 174#L57-2true, Black: 458#true, 211#thread1ENTRYtrue, 460#(= |#race~n~0| 0), 69#L49-2true, Black: 434#true, Black: 438#true, 468#true, Black: 442#true]) [2025-02-08 05:37:15,621 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2025-02-08 05:37:15,621 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-02-08 05:37:15,621 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-08 05:37:15,621 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-02-08 05:37:15,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [Black: 446#true, 368#L41-2true, 323#L73-2true, Black: 450#true, 63#thread2ENTRYtrue, 465#true, 454#true, 174#L57-2true, Black: 458#true, 219#L65-2true, 460#(= |#race~n~0| 0), 208#thread6ENTRYtrue, Black: 434#true, Black: 438#true, 468#true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:15,695 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-02-08 05:37:15,695 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-02-08 05:37:15,696 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-08 05:37:15,696 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-08 05:37:15,696 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [368#L41-2true, Black: 450#true, 63#thread2ENTRYtrue, 465#true, 454#true, 174#L57-2true, Black: 458#true, 219#L65-2true, 460#(= |#race~n~0| 0), 208#thread6ENTRYtrue, Black: 434#true, 236#thread5ENTRYtrue, Black: 438#true, 468#true, Black: 442#true, 446#true, 355#L108-1true]) [2025-02-08 05:37:15,696 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2025-02-08 05:37:15,696 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-02-08 05:37:15,696 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-02-08 05:37:15,696 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-02-08 05:37:15,697 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [368#L41-2true, Black: 450#true, 63#thread2ENTRYtrue, Black: 454#true, 465#true, 174#L57-2true, Black: 458#true, 219#L65-2true, 460#(= |#race~n~0| 0), Black: 434#true, 236#thread5ENTRYtrue, Black: 438#true, 468#true, 226#L81-2true, Black: 442#true, 446#true, 355#L108-1true]) [2025-02-08 05:37:15,697 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-02-08 05:37:15,697 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-08 05:37:15,697 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-02-08 05:37:15,697 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-08 05:37:15,702 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [Black: 450#true, 465#true, 454#true, 219#L65-2true, 174#L57-2true, Black: 458#true, 460#(= |#race~n~0| 0), 69#L49-2true, 211#thread1ENTRYtrue, 208#thread6ENTRYtrue, Black: 434#true, 236#thread5ENTRYtrue, Black: 438#true, 468#true, Black: 442#true, 355#L108-1true, 446#true]) [2025-02-08 05:37:15,702 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2025-02-08 05:37:15,702 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-02-08 05:37:15,702 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-02-08 05:37:15,702 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-02-08 05:37:15,702 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [Black: 446#true, 323#L73-2true, Black: 450#true, 465#true, 454#true, 174#L57-2true, Black: 458#true, 219#L65-2true, 460#(= |#race~n~0| 0), 69#L49-2true, 211#thread1ENTRYtrue, 208#thread6ENTRYtrue, Black: 434#true, Black: 438#true, 468#true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:15,702 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-02-08 05:37:15,702 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-08 05:37:15,702 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-08 05:37:15,702 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-02-08 05:37:15,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [Black: 450#true, Black: 454#true, 465#true, 219#L65-2true, 174#L57-2true, Black: 458#true, 460#(= |#race~n~0| 0), 69#L49-2true, 211#thread1ENTRYtrue, Black: 434#true, 236#thread5ENTRYtrue, Black: 438#true, 468#true, 226#L81-2true, Black: 442#true, 446#true, 355#L108-1true]) [2025-02-08 05:37:15,703 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-02-08 05:37:15,703 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-08 05:37:15,703 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-08 05:37:15,703 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-02-08 05:37:15,834 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [281#L107-1true, Black: 446#true, 368#L41-2true, Black: 450#true, Black: 454#true, 465#true, 174#L57-2true, Black: 458#true, 219#L65-2true, 460#(= |#race~n~0| 0), 69#L49-2true, Black: 434#true, 236#thread5ENTRYtrue, Black: 438#true, 468#true, Black: 442#true]) [2025-02-08 05:37:15,835 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2025-02-08 05:37:15,835 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-08 05:37:15,835 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-02-08 05:37:15,835 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-02-08 05:37:15,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [281#L107-1true, 368#L41-2true, Black: 446#true, 323#L73-2true, Black: 450#true, Black: 454#true, 465#true, 174#L57-2true, Black: 458#true, 219#L65-2true, 69#L49-2true, 460#(= |#race~n~0| 0), Black: 434#true, Black: 438#true, 468#true, Black: 442#true]) [2025-02-08 05:37:15,836 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-02-08 05:37:15,836 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-02-08 05:37:15,836 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-02-08 05:37:15,836 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-02-08 05:37:15,906 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [368#L41-2true, Black: 446#true, 323#L73-2true, Black: 450#true, 465#true, 454#true, 219#L65-2true, 174#L57-2true, Black: 458#true, 69#L49-2true, 460#(= |#race~n~0| 0), 208#thread6ENTRYtrue, Black: 434#true, Black: 438#true, 468#true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:15,907 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-02-08 05:37:15,907 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-02-08 05:37:15,907 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-02-08 05:37:15,907 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-08 05:37:15,907 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [368#L41-2true, Black: 450#true, 465#true, 454#true, Black: 458#true, 219#L65-2true, 174#L57-2true, 69#L49-2true, 460#(= |#race~n~0| 0), 208#thread6ENTRYtrue, Black: 434#true, 236#thread5ENTRYtrue, Black: 438#true, 468#true, Black: 442#true, 446#true, 355#L108-1true]) [2025-02-08 05:37:15,907 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-02-08 05:37:15,907 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-02-08 05:37:15,907 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-08 05:37:15,907 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-08 05:37:15,907 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [368#L41-2true, Black: 450#true, Black: 454#true, 465#true, 174#L57-2true, Black: 458#true, 219#L65-2true, 460#(= |#race~n~0| 0), 69#L49-2true, Black: 434#true, 236#thread5ENTRYtrue, Black: 438#true, 468#true, 226#L81-2true, Black: 442#true, 446#true, 355#L108-1true]) [2025-02-08 05:37:15,907 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-02-08 05:37:15,907 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-02-08 05:37:15,907 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-02-08 05:37:15,907 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-08 05:37:15,948 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [Black: 446#true, 368#L41-2true, Black: 450#true, 63#thread2ENTRYtrue, Black: 454#true, 465#true, Black: 458#true, 219#L65-2true, 174#L57-2true, 460#(= |#race~n~0| 0), 208#thread6ENTRYtrue, Black: 434#true, 236#thread5ENTRYtrue, Black: 438#true, 468#true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:15,949 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-02-08 05:37:15,949 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-02-08 05:37:15,949 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-02-08 05:37:15,949 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-02-08 05:37:15,949 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [368#L41-2true, Black: 446#true, 323#L73-2true, Black: 450#true, 63#thread2ENTRYtrue, Black: 454#true, 465#true, 174#L57-2true, Black: 458#true, 219#L65-2true, 460#(= |#race~n~0| 0), 208#thread6ENTRYtrue, Black: 434#true, Black: 438#true, 468#true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:15,949 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-02-08 05:37:15,949 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-02-08 05:37:15,949 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-02-08 05:37:15,949 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-02-08 05:37:15,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [Black: 446#true, 368#L41-2true, Black: 450#true, 63#thread2ENTRYtrue, Black: 454#true, 465#true, 174#L57-2true, Black: 458#true, 219#L65-2true, 460#(= |#race~n~0| 0), Black: 434#true, 236#thread5ENTRYtrue, Black: 438#true, 468#true, 226#L81-2true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:15,950 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-02-08 05:37:15,950 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-02-08 05:37:15,950 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-02-08 05:37:15,950 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-02-08 05:37:15,953 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [Black: 446#true, Black: 450#true, Black: 454#true, 465#true, 174#L57-2true, Black: 458#true, 219#L65-2true, 211#thread1ENTRYtrue, 460#(= |#race~n~0| 0), 69#L49-2true, 208#thread6ENTRYtrue, Black: 434#true, 236#thread5ENTRYtrue, Black: 438#true, 468#true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:15,953 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-02-08 05:37:15,953 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-02-08 05:37:15,953 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-02-08 05:37:15,953 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-02-08 05:37:15,953 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [Black: 446#true, 323#L73-2true, Black: 450#true, Black: 454#true, 465#true, 174#L57-2true, Black: 458#true, 219#L65-2true, 211#thread1ENTRYtrue, 460#(= |#race~n~0| 0), 69#L49-2true, 208#thread6ENTRYtrue, Black: 434#true, Black: 438#true, 468#true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:15,953 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-02-08 05:37:15,954 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-02-08 05:37:15,954 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-02-08 05:37:15,954 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-02-08 05:37:15,954 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [Black: 446#true, Black: 450#true, Black: 454#true, 465#true, 174#L57-2true, Black: 458#true, 219#L65-2true, 211#thread1ENTRYtrue, 460#(= |#race~n~0| 0), 69#L49-2true, Black: 434#true, 236#thread5ENTRYtrue, Black: 438#true, 468#true, 226#L81-2true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:15,954 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-02-08 05:37:15,954 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-02-08 05:37:15,954 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-02-08 05:37:15,954 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-02-08 05:37:16,055 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [368#L41-2true, Black: 446#true, 323#L73-2true, Black: 450#true, 63#thread2ENTRYtrue, Black: 454#true, 465#true, 219#L65-2true, 174#L57-2true, Black: 458#true, 460#(= |#race~n~0| 0), Black: 434#true, Black: 438#true, 468#true, 226#L81-2true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:16,056 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-02-08 05:37:16,056 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-08 05:37:16,056 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-02-08 05:37:16,056 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-02-08 05:37:16,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [Black: 446#true, 323#L73-2true, Black: 450#true, Black: 454#true, 465#true, 174#L57-2true, Black: 458#true, 219#L65-2true, 460#(= |#race~n~0| 0), 69#L49-2true, 211#thread1ENTRYtrue, Black: 434#true, Black: 438#true, 468#true, 226#L81-2true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:16,059 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-02-08 05:37:16,059 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-02-08 05:37:16,059 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-08 05:37:16,059 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-02-08 05:37:16,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [Black: 446#true, 368#L41-2true, 323#L73-2true, Black: 450#true, Black: 454#true, 465#true, 219#L65-2true, 174#L57-2true, Black: 458#true, 460#(= |#race~n~0| 0), 69#L49-2true, 208#thread6ENTRYtrue, Black: 434#true, Black: 438#true, 468#true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:16,118 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2025-02-08 05:37:16,119 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-02-08 05:37:16,119 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-02-08 05:37:16,119 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-08 05:37:16,119 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [Black: 446#true, 368#L41-2true, Black: 450#true, Black: 454#true, 465#true, 219#L65-2true, 174#L57-2true, Black: 458#true, 460#(= |#race~n~0| 0), 69#L49-2true, 208#thread6ENTRYtrue, Black: 434#true, 236#thread5ENTRYtrue, Black: 438#true, 468#true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:16,119 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-02-08 05:37:16,119 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-02-08 05:37:16,119 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-02-08 05:37:16,119 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-02-08 05:37:16,119 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [Black: 446#true, 368#L41-2true, Black: 450#true, Black: 454#true, 465#true, 174#L57-2true, Black: 458#true, 219#L65-2true, 69#L49-2true, 460#(= |#race~n~0| 0), Black: 434#true, 236#thread5ENTRYtrue, Black: 438#true, 468#true, 226#L81-2true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:16,120 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2025-02-08 05:37:16,120 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-08 05:37:16,120 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-02-08 05:37:16,120 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-02-08 05:37:16,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][156], [368#L41-2true, Black: 446#true, 323#L73-2true, Black: 450#true, Black: 454#true, 465#true, 174#L57-2true, Black: 458#true, 219#L65-2true, 460#(= |#race~n~0| 0), 69#L49-2true, Black: 434#true, Black: 438#true, 468#true, 226#L81-2true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:16,196 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2025-02-08 05:37:16,196 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-02-08 05:37:16,196 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-02-08 05:37:16,196 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-02-08 05:37:16,345 INFO L124 PetriNetUnfolderBase]: 2759/11154 cut-off events. [2025-02-08 05:37:16,346 INFO L125 PetriNetUnfolderBase]: For 415/431 co-relation queries the response was YES. [2025-02-08 05:37:16,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16916 conditions, 11154 events. 2759/11154 cut-off events. For 415/431 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 130787 event pairs, 821 based on Foata normal form. 0/9788 useless extension candidates. Maximal degree in co-relation 16112. Up to 2391 conditions per place. [2025-02-08 05:37:16,515 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2025-02-08 05:37:16,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 267 transitions, 684 flow [2025-02-08 05:37:16,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:16,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-02-08 05:37:16,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-02-08 05:37:16,517 INFO L175 Difference]: Start difference. First operand has 267 places, 263 transitions, 619 flow. Second operand 3 states and 1172 transitions. [2025-02-08 05:37:16,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 267 transitions, 684 flow [2025-02-08 05:37:16,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 267 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:16,525 INFO L231 Difference]: Finished difference. Result has 266 places, 262 transitions, 617 flow [2025-02-08 05:37:16,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=266, PETRI_TRANSITIONS=262} [2025-02-08 05:37:16,525 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -113 predicate places. [2025-02-08 05:37:16,525 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 262 transitions, 617 flow [2025-02-08 05:37:16,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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-02-08 05:37:16,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:16,526 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:16,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:37:16,526 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-02-08 05:37:16,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:16,527 INFO L85 PathProgramCache]: Analyzing trace with hash 461385405, now seen corresponding path program 1 times [2025-02-08 05:37:16,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:16,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355475097] [2025-02-08 05:37:16,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:16,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:16,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:37:16,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:37:16,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:16,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:16,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:16,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355475097] [2025-02-08 05:37:16,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355475097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:16,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:16,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:16,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593200000] [2025-02-08 05:37:16,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:16,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:16,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:16,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:16,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:16,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2025-02-08 05:37:16,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 262 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 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-02-08 05:37:16,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:16,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2025-02-08 05:37:16,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:17,374 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([896] L65-4-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][181], [Black: 446#true, 323#L73-2true, Black: 450#true, 63#thread2ENTRYtrue, 454#true, 174#L57-2true, 219#L65-2true, Black: 458#true, 460#(= |#race~n~0| 0), 211#thread1ENTRYtrue, 208#thread6ENTRYtrue, Black: 434#true, 471#true, Black: 438#true, 468#true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:17,374 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2025-02-08 05:37:17,374 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-02-08 05:37:17,374 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-02-08 05:37:17,374 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-02-08 05:37:17,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([896] L65-4-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][181], [Black: 446#true, 323#L73-2true, Black: 450#true, 63#thread2ENTRYtrue, Black: 454#true, 219#L65-2true, Black: 458#true, 174#L57-2true, 460#(= |#race~n~0| 0), 211#thread1ENTRYtrue, Black: 434#true, 471#true, Black: 438#true, 468#true, 226#L81-2true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:17,375 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-02-08 05:37:17,375 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-02-08 05:37:17,375 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-08 05:37:17,375 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-08 05:37:17,541 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([896] L65-4-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][181], [368#L41-2true, Black: 446#true, 323#L73-2true, Black: 450#true, 63#thread2ENTRYtrue, 454#true, 219#L65-2true, Black: 458#true, 174#L57-2true, 460#(= |#race~n~0| 0), 208#thread6ENTRYtrue, Black: 434#true, 471#true, Black: 438#true, 468#true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:17,541 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-02-08 05:37:17,541 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-08 05:37:17,541 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-02-08 05:37:17,541 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-08 05:37:17,541 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([896] L65-4-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][181], [368#L41-2true, Black: 446#true, 323#L73-2true, Black: 450#true, 63#thread2ENTRYtrue, Black: 454#true, 174#L57-2true, 219#L65-2true, Black: 458#true, 460#(= |#race~n~0| 0), Black: 434#true, 471#true, Black: 438#true, 468#true, 226#L81-2true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:17,541 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-02-08 05:37:17,542 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-02-08 05:37:17,542 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-08 05:37:17,542 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-02-08 05:37:17,544 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([896] L65-4-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][181], [Black: 446#true, 323#L73-2true, Black: 450#true, 454#true, 219#L65-2true, Black: 458#true, 174#L57-2true, 460#(= |#race~n~0| 0), 69#L49-2true, 211#thread1ENTRYtrue, 208#thread6ENTRYtrue, Black: 434#true, 471#true, Black: 438#true, 468#true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:17,544 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-02-08 05:37:17,544 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-08 05:37:17,544 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-02-08 05:37:17,544 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-08 05:37:17,545 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([896] L65-4-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][181], [Black: 446#true, 323#L73-2true, Black: 450#true, Black: 454#true, 174#L57-2true, 219#L65-2true, Black: 458#true, 460#(= |#race~n~0| 0), 69#L49-2true, 211#thread1ENTRYtrue, Black: 434#true, 471#true, Black: 438#true, 468#true, 226#L81-2true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:17,545 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-02-08 05:37:17,545 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-08 05:37:17,545 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-02-08 05:37:17,545 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-02-08 05:37:17,598 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([896] L65-4-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][181], [Black: 446#true, 323#L73-2true, Black: 450#true, 63#thread2ENTRYtrue, Black: 454#true, 219#L65-2true, Black: 458#true, 174#L57-2true, 211#thread1ENTRYtrue, 460#(= |#race~n~0| 0), 208#thread6ENTRYtrue, Black: 434#true, 471#true, Black: 438#true, 468#true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:17,598 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-02-08 05:37:17,599 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-02-08 05:37:17,599 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-02-08 05:37:17,599 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-02-08 05:37:17,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([896] L65-4-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][181], [368#L41-2true, Black: 446#true, 323#L73-2true, Black: 450#true, 454#true, 219#L65-2true, 174#L57-2true, Black: 458#true, 460#(= |#race~n~0| 0), 69#L49-2true, 208#thread6ENTRYtrue, Black: 434#true, 471#true, Black: 438#true, 468#true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:17,695 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-02-08 05:37:17,695 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-08 05:37:17,696 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-02-08 05:37:17,696 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-02-08 05:37:17,696 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([896] L65-4-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][181], [368#L41-2true, Black: 446#true, 323#L73-2true, Black: 450#true, Black: 454#true, 219#L65-2true, Black: 458#true, 174#L57-2true, 460#(= |#race~n~0| 0), 69#L49-2true, Black: 434#true, 471#true, Black: 438#true, 468#true, 226#L81-2true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:17,696 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2025-02-08 05:37:17,696 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-02-08 05:37:17,696 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-02-08 05:37:17,696 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-02-08 05:37:17,734 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([896] L65-4-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][181], [Black: 446#true, 368#L41-2true, 323#L73-2true, Black: 450#true, 63#thread2ENTRYtrue, Black: 454#true, 174#L57-2true, 219#L65-2true, Black: 458#true, 460#(= |#race~n~0| 0), 208#thread6ENTRYtrue, Black: 434#true, 471#true, Black: 438#true, 468#true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:17,735 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-02-08 05:37:17,735 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-02-08 05:37:17,735 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-02-08 05:37:17,735 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-02-08 05:37:17,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([896] L65-4-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][181], [Black: 446#true, 323#L73-2true, Black: 450#true, Black: 454#true, 219#L65-2true, Black: 458#true, 174#L57-2true, 211#thread1ENTRYtrue, 460#(= |#race~n~0| 0), 69#L49-2true, 208#thread6ENTRYtrue, Black: 434#true, 471#true, Black: 438#true, 468#true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:17,736 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-02-08 05:37:17,736 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-02-08 05:37:17,736 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-02-08 05:37:17,736 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-02-08 05:37:17,823 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([896] L65-4-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][181], [Black: 446#true, 368#L41-2true, 323#L73-2true, Black: 450#true, Black: 454#true, 174#L57-2true, 219#L65-2true, Black: 458#true, 69#L49-2true, 460#(= |#race~n~0| 0), 208#thread6ENTRYtrue, Black: 434#true, 471#true, Black: 438#true, 468#true, Black: 442#true, 355#L108-1true]) [2025-02-08 05:37:17,824 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2025-02-08 05:37:17,824 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-08 05:37:17,824 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-02-08 05:37:17,824 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-02-08 05:37:17,905 INFO L124 PetriNetUnfolderBase]: 2518/9571 cut-off events. [2025-02-08 05:37:17,905 INFO L125 PetriNetUnfolderBase]: For 513/535 co-relation queries the response was YES. [2025-02-08 05:37:18,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15083 conditions, 9571 events. 2518/9571 cut-off events. For 513/535 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 108274 event pairs, 801 based on Foata normal form. 2/8501 useless extension candidates. Maximal degree in co-relation 14259. Up to 2069 conditions per place. [2025-02-08 05:37:18,076 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2025-02-08 05:37:18,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 266 transitions, 682 flow [2025-02-08 05:37:18,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:18,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:18,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-02-08 05:37:18,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-02-08 05:37:18,079 INFO L175 Difference]: Start difference. First operand has 266 places, 262 transitions, 617 flow. Second operand 3 states and 1172 transitions. [2025-02-08 05:37:18,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 266 transitions, 682 flow [2025-02-08 05:37:18,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 266 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:18,087 INFO L231 Difference]: Finished difference. Result has 265 places, 261 transitions, 615 flow [2025-02-08 05:37:18,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=615, PETRI_PLACES=265, PETRI_TRANSITIONS=261} [2025-02-08 05:37:18,088 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -114 predicate places. [2025-02-08 05:37:18,088 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 261 transitions, 615 flow [2025-02-08 05:37:18,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 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-02-08 05:37:18,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:18,088 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] [2025-02-08 05:37:18,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:37:18,089 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread5Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-02-08 05:37:18,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:18,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2097575760, now seen corresponding path program 1 times [2025-02-08 05:37:18,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:18,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208112992] [2025-02-08 05:37:18,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:18,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:18,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 05:37:18,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 05:37:18,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:18,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:18,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-02-08 05:37:18,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:18,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208112992] [2025-02-08 05:37:18,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208112992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:18,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:18,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:18,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316900272] [2025-02-08 05:37:18,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:18,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:18,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:18,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:18,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:18,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2025-02-08 05:37:18,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 261 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 386.0) internal successors, (1158), 3 states have internal predecessors, (1158), 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-02-08 05:37:18,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:18,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2025-02-08 05:37:18,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:19,169 INFO L124 PetriNetUnfolderBase]: 1913/7669 cut-off events. [2025-02-08 05:37:19,169 INFO L125 PetriNetUnfolderBase]: For 458/501 co-relation queries the response was YES. [2025-02-08 05:37:19,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11777 conditions, 7669 events. 1913/7669 cut-off events. For 458/501 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 82621 event pairs, 588 based on Foata normal form. 5/6799 useless extension candidates. Maximal degree in co-relation 10600. Up to 1778 conditions per place. [2025-02-08 05:37:19,287 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2025-02-08 05:37:19,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 265 transitions, 680 flow [2025-02-08 05:37:19,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:19,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:19,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-02-08 05:37:19,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-02-08 05:37:19,290 INFO L175 Difference]: Start difference. First operand has 265 places, 261 transitions, 615 flow. Second operand 3 states and 1172 transitions. [2025-02-08 05:37:19,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 265 transitions, 680 flow [2025-02-08 05:37:19,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 265 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:19,299 INFO L231 Difference]: Finished difference. Result has 264 places, 260 transitions, 613 flow [2025-02-08 05:37:19,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=264, PETRI_TRANSITIONS=260} [2025-02-08 05:37:19,300 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -115 predicate places. [2025-02-08 05:37:19,300 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 260 transitions, 613 flow [2025-02-08 05:37:19,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.0) internal successors, (1158), 3 states have internal predecessors, (1158), 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-02-08 05:37:19,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:19,301 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] [2025-02-08 05:37:19,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:37:19,301 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread6Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-02-08 05:37:19,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:19,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1999098591, now seen corresponding path program 1 times [2025-02-08 05:37:19,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:19,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507979789] [2025-02-08 05:37:19,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:19,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:19,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-08 05:37:19,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-08 05:37:19,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:19,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:19,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:19,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507979789] [2025-02-08 05:37:19,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507979789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:19,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:19,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:19,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712250309] [2025-02-08 05:37:19,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:19,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:19,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:19,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:19,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:19,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2025-02-08 05:37:19,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 260 transitions, 613 flow. Second operand has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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-02-08 05:37:19,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:19,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2025-02-08 05:37:19,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:19,948 INFO L124 PetriNetUnfolderBase]: 1313/5788 cut-off events. [2025-02-08 05:37:19,949 INFO L125 PetriNetUnfolderBase]: For 228/256 co-relation queries the response was YES. [2025-02-08 05:37:19,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8377 conditions, 5788 events. 1313/5788 cut-off events. For 228/256 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 58368 event pairs, 333 based on Foata normal form. 4/5109 useless extension candidates. Maximal degree in co-relation 7649. Up to 1400 conditions per place. [2025-02-08 05:37:19,985 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 0 selfloop transitions, 0 changer transitions 264/264 dead transitions. [2025-02-08 05:37:19,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 264 transitions, 678 flow [2025-02-08 05:37:19,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-02-08 05:37:19,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-02-08 05:37:19,987 INFO L175 Difference]: Start difference. First operand has 264 places, 260 transitions, 613 flow. Second operand 3 states and 1172 transitions. [2025-02-08 05:37:19,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 264 transitions, 678 flow [2025-02-08 05:37:19,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 264 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:19,997 INFO L231 Difference]: Finished difference. Result has 263 places, 0 transitions, 0 flow [2025-02-08 05:37:19,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=263, PETRI_TRANSITIONS=0} [2025-02-08 05:37:20,001 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -116 predicate places. [2025-02-08 05:37:20,001 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 0 transitions, 0 flow [2025-02-08 05:37:20,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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-02-08 05:37:20,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (96 of 97 remaining) [2025-02-08 05:37:20,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (95 of 97 remaining) [2025-02-08 05:37:20,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (94 of 97 remaining) [2025-02-08 05:37:20,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (93 of 97 remaining) [2025-02-08 05:37:20,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (92 of 97 remaining) [2025-02-08 05:37:20,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (91 of 97 remaining) [2025-02-08 05:37:20,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (90 of 97 remaining) [2025-02-08 05:37:20,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (89 of 97 remaining) [2025-02-08 05:37:20,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (88 of 97 remaining) [2025-02-08 05:37:20,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (87 of 97 remaining) [2025-02-08 05:37:20,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (86 of 97 remaining) [2025-02-08 05:37:20,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (85 of 97 remaining) [2025-02-08 05:37:20,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (84 of 97 remaining) [2025-02-08 05:37:20,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (83 of 97 remaining) [2025-02-08 05:37:20,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (82 of 97 remaining) [2025-02-08 05:37:20,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (81 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (80 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (79 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (78 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (77 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (76 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (75 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (74 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (73 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (72 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (71 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (70 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (69 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (68 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (67 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (66 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (65 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (64 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (63 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (62 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (61 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (60 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (59 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (58 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (57 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (56 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (55 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (54 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (53 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (52 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (51 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (44 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (43 of 97 remaining) [2025-02-08 05:37:20,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (42 of 97 remaining) [2025-02-08 05:37:20,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (41 of 97 remaining) [2025-02-08 05:37:20,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (40 of 97 remaining) [2025-02-08 05:37:20,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (39 of 97 remaining) [2025-02-08 05:37:20,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (38 of 97 remaining) [2025-02-08 05:37:20,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (37 of 97 remaining) [2025-02-08 05:37:20,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (36 of 97 remaining) [2025-02-08 05:37:20,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (35 of 97 remaining) [2025-02-08 05:37:20,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (34 of 97 remaining) [2025-02-08 05:37:20,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (33 of 97 remaining) [2025-02-08 05:37:20,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (32 of 97 remaining) [2025-02-08 05:37:20,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (31 of 97 remaining) [2025-02-08 05:37:20,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (30 of 97 remaining) [2025-02-08 05:37:20,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (29 of 97 remaining) [2025-02-08 05:37:20,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (26 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (25 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (24 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (23 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (21 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (20 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (19 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (18 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (17 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (16 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (15 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (14 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (13 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (12 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (11 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (10 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (9 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (8 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (7 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (6 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (5 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (4 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (3 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (1 of 97 remaining) [2025-02-08 05:37:20,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (0 of 97 remaining) [2025-02-08 05:37:20,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:37:20,017 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] [2025-02-08 05:37:20,029 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:37:20,030 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:37:20,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:37:20 BasicIcfg [2025-02-08 05:37:20,040 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:37:20,041 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:37:20,041 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:37:20,041 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:37:20,042 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:01" (3/4) ... [2025-02-08 05:37:20,043 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:37:20,045 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:37:20,045 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:37:20,045 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:37:20,045 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-08 05:37:20,046 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread5 [2025-02-08 05:37:20,046 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread6 [2025-02-08 05:37:20,052 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-02-08 05:37:20,054 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 05:37:20,054 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 05:37:20,054 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:37:20,122 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:37:20,123 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:37:20,123 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:37:20,123 INFO L158 Benchmark]: Toolchain (without parser) took 19759.23ms. Allocated memory was 167.8MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 123.2MB in the beginning and 4.1GB in the end (delta: -3.9GB). Peak memory consumption was 858.8MB. Max. memory is 16.1GB. [2025-02-08 05:37:20,124 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 218.1MB. Free memory is still 137.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:20,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.26ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 110.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:20,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.05ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 108.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:20,126 INFO L158 Benchmark]: Boogie Preprocessor took 35.87ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 107.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:20,126 INFO L158 Benchmark]: IcfgBuilder took 525.57ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 79.9MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:37:20,126 INFO L158 Benchmark]: TraceAbstraction took 18850.35ms. Allocated memory was 167.8MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 79.2MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. [2025-02-08 05:37:20,126 INFO L158 Benchmark]: Witness Printer took 82.00ms. Allocated memory is still 5.0GB. Free memory was 4.1GB in the beginning and 4.1GB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:20,128 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 218.1MB. Free memory is still 137.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.26ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 110.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.05ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 108.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.87ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 107.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 525.57ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 79.9MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18850.35ms. Allocated memory was 167.8MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 79.2MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. * Witness Printer took 82.00ms. Allocated memory is still 5.0GB. Free memory was 4.1GB in the beginning and 4.1GB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: 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: 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: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: 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 13 procedures, 536 locations, 97 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: 18.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1123 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 414 mSDsluCounter, 209 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1246 IncrementalHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 209 mSDtfsCounter, 1246 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=800occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1604 NumberOfCodeBlocks, 1604 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1584 ConstructedInterpolants, 0 QuantifiedInterpolants, 1624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 61 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:37:20,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE