./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:29:00,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:29:00,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:29:00,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:29:00,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:29:00,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:29:00,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:29:00,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:29:00,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:29:00,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:29:00,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:29:00,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:29:00,333 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:29:00,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:29:00,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:29:00,333 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:29:00,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:29:00,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:29:00,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:29:00,334 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:29:00,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:29:00,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:29:00,334 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:29:00,334 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:29:00,334 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:29:00,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:29:00,334 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:29:00,334 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:29:00,334 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:29:00,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:29:00,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:29:00,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:29:00,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:29:00,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:29:00,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:29:00,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:29:00,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:29:00,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:29:00,335 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:29:00,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:29:00,335 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:29:00,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:29:00,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:29:00,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:29:00,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:29:00,336 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 [2025-04-30 10:29:00,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:29:00,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:29:00,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:29:00,567 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:29:00,567 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:29:00,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-04-30 10:29:01,892 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8d68a3b5/35f0ac74295f4c0ca42cb6b3051c13e2/FLAGdf374b34f [2025-04-30 10:29:02,110 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:29:02,110 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-04-30 10:29:02,120 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8d68a3b5/35f0ac74295f4c0ca42cb6b3051c13e2/FLAGdf374b34f [2025-04-30 10:29:02,892 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8d68a3b5/35f0ac74295f4c0ca42cb6b3051c13e2 [2025-04-30 10:29:02,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:29:02,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:29:02,895 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:29:02,895 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:29:02,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:29:02,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:29:02" (1/1) ... [2025-04-30 10:29:02,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3066bb92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:02, skipping insertion in model container [2025-04-30 10:29:02,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:29:02" (1/1) ... [2025-04-30 10:29:02,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:29:03,236 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:29:03,245 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:29:03,321 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:29:03,348 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:29:03,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:03 WrapperNode [2025-04-30 10:29:03,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:29:03,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:29:03,349 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:29:03,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:29:03,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:03" (1/1) ... [2025-04-30 10:29:03,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:03" (1/1) ... [2025-04-30 10:29:03,388 INFO L138 Inliner]: procedures = 165, calls = 35, calls flagged for inlining = 8, calls inlined = 9, statements flattened = 171 [2025-04-30 10:29:03,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:29:03,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:29:03,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:29:03,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:29:03,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:03" (1/1) ... [2025-04-30 10:29:03,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:03" (1/1) ... [2025-04-30 10:29:03,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:03" (1/1) ... [2025-04-30 10:29:03,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:03" (1/1) ... [2025-04-30 10:29:03,414 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:03" (1/1) ... [2025-04-30 10:29:03,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:03" (1/1) ... [2025-04-30 10:29:03,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:03" (1/1) ... [2025-04-30 10:29:03,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:03" (1/1) ... [2025-04-30 10:29:03,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:03" (1/1) ... [2025-04-30 10:29:03,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:29:03,425 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:29:03,425 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:29:03,425 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:29:03,425 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:03" (1/1) ... [2025-04-30 10:29:03,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:29:03,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:29:03,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:29:03,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:29:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:29:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-04-30 10:29:03,471 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-04-30 10:29:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:29:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:29:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:29:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:29:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:29:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:29:03,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:29:03,472 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:29:03,574 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:29:03,576 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:29:03,876 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:29:03,876 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:29:03,893 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:29:03,893 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-30 10:29:03,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:29:03 BoogieIcfgContainer [2025-04-30 10:29:03,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:29:03,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:29:03,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:29:03,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:29:03,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:29:02" (1/3) ... [2025-04-30 10:29:03,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac743ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:29:03, skipping insertion in model container [2025-04-30 10:29:03,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:03" (2/3) ... [2025-04-30 10:29:03,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac743ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:29:03, skipping insertion in model container [2025-04-30 10:29:03,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:29:03" (3/3) ... [2025-04-30 10:29:03,901 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-04-30 10:29:03,911 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:29:03,914 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i that has 2 procedures, 197 locations, 205 edges, 1 initial locations, 3 loop locations, and 10 error locations. [2025-04-30 10:29:03,915 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:29:03,992 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:29:04,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 206 transitions, 416 flow [2025-04-30 10:29:04,101 INFO L116 PetriNetUnfolderBase]: 10/205 cut-off events. [2025-04-30 10:29:04,103 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:29:04,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 205 events. 10/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 412 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2025-04-30 10:29:04,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 206 transitions, 416 flow [2025-04-30 10:29:04,118 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 205 transitions, 413 flow [2025-04-30 10:29:04,127 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:29:04,136 INFO L340 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;@e9b244a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:29:04,138 INFO L341 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-04-30 10:29:04,145 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:29:04,147 INFO L116 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-04-30 10:29:04,148 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:29:04,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:04,148 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] [2025-04-30 10:29:04,149 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:29:04,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:04,153 INFO L85 PathProgramCache]: Analyzing trace with hash -512101648, now seen corresponding path program 1 times [2025-04-30 10:29:04,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:04,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008528215] [2025-04-30 10:29:04,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:04,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:04,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:29:04,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:29:04,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:04,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:04,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:04,665 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008528215] [2025-04-30 10:29:04,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008528215] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:04,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:04,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:04,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282097491] [2025-04-30 10:29:04,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:04,673 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:04,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:04,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:04,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:04,913 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 206 [2025-04-30 10:29:04,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 205 transitions, 413 flow. Second operand has 6 states, 6 states have (on average 146.33333333333334) internal successors, (878), 6 states have internal predecessors, (878), 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-04-30 10:29:04,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:04,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 206 [2025-04-30 10:29:04,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:05,228 INFO L116 PetriNetUnfolderBase]: 479/1990 cut-off events. [2025-04-30 10:29:05,229 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:29:05,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2876 conditions, 1990 events. 479/1990 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 14208 event pairs, 378 based on Foata normal form. 102/1898 useless extension candidates. Maximal degree in co-relation 2817. Up to 877 conditions per place. [2025-04-30 10:29:05,249 INFO L140 encePairwiseOnDemand]: 194/206 looper letters, 47 selfloop transitions, 5 changer transitions 0/192 dead transitions. [2025-04-30 10:29:05,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 192 transitions, 491 flow [2025-04-30 10:29:05,251 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:05,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 929 transitions. [2025-04-30 10:29:05,266 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7516181229773463 [2025-04-30 10:29:05,268 INFO L175 Difference]: Start difference. First operand has 199 places, 205 transitions, 413 flow. Second operand 6 states and 929 transitions. [2025-04-30 10:29:05,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 192 transitions, 491 flow [2025-04-30 10:29:05,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 192 transitions, 490 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:29:05,280 INFO L231 Difference]: Finished difference. Result has 195 places, 192 transitions, 396 flow [2025-04-30 10:29:05,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=396, PETRI_PLACES=195, PETRI_TRANSITIONS=192} [2025-04-30 10:29:05,285 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, -4 predicate places. [2025-04-30 10:29:05,286 INFO L485 AbstractCegarLoop]: Abstraction has has 195 places, 192 transitions, 396 flow [2025-04-30 10:29:05,286 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 146.33333333333334) internal successors, (878), 6 states have internal predecessors, (878), 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-04-30 10:29:05,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:05,287 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] [2025-04-30 10:29:05,287 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:29:05,287 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:29:05,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:05,288 INFO L85 PathProgramCache]: Analyzing trace with hash -952397381, now seen corresponding path program 1 times [2025-04-30 10:29:05,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:05,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926058383] [2025-04-30 10:29:05,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:05,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:05,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:29:05,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:29:05,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:05,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:05,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:05,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:05,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926058383] [2025-04-30 10:29:05,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926058383] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:05,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:05,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:05,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102067491] [2025-04-30 10:29:05,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:05,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:05,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:05,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:05,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:05,945 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 206 [2025-04-30 10:29:05,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 192 transitions, 396 flow. Second operand has 6 states, 6 states have (on average 148.16666666666666) internal successors, (889), 6 states have internal predecessors, (889), 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-04-30 10:29:05,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:05,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 206 [2025-04-30 10:29:05,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:06,208 INFO L116 PetriNetUnfolderBase]: 592/2760 cut-off events. [2025-04-30 10:29:06,209 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:29:06,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3875 conditions, 2760 events. 592/2760 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 21933 event pairs, 78 based on Foata normal form. 0/2530 useless extension candidates. Maximal degree in co-relation 3831. Up to 653 conditions per place. [2025-04-30 10:29:06,220 INFO L140 encePairwiseOnDemand]: 170/206 looper letters, 76 selfloop transitions, 43 changer transitions 0/259 dead transitions. [2025-04-30 10:29:06,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 259 transitions, 768 flow [2025-04-30 10:29:06,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:06,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1000 transitions. [2025-04-30 10:29:06,222 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8090614886731392 [2025-04-30 10:29:06,222 INFO L175 Difference]: Start difference. First operand has 195 places, 192 transitions, 396 flow. Second operand 6 states and 1000 transitions. [2025-04-30 10:29:06,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 259 transitions, 768 flow [2025-04-30 10:29:06,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 259 transitions, 758 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:29:06,229 INFO L231 Difference]: Finished difference. Result has 200 places, 235 transitions, 716 flow [2025-04-30 10:29:06,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=716, PETRI_PLACES=200, PETRI_TRANSITIONS=235} [2025-04-30 10:29:06,231 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 1 predicate places. [2025-04-30 10:29:06,232 INFO L485 AbstractCegarLoop]: Abstraction has has 200 places, 235 transitions, 716 flow [2025-04-30 10:29:06,232 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.16666666666666) internal successors, (889), 6 states have internal predecessors, (889), 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-04-30 10:29:06,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:06,233 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:06,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:29:06,233 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:29:06,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:06,234 INFO L85 PathProgramCache]: Analyzing trace with hash 942355989, now seen corresponding path program 1 times [2025-04-30 10:29:06,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:06,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768640891] [2025-04-30 10:29:06,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:06,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:06,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:29:06,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:29:06,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:06,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:06,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:06,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:06,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768640891] [2025-04-30 10:29:06,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768640891] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:06,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:06,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:06,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784552395] [2025-04-30 10:29:06,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:06,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:06,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:06,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:06,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:06,802 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 206 [2025-04-30 10:29:06,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 235 transitions, 716 flow. Second operand has 6 states, 6 states have (on average 166.16666666666666) internal successors, (997), 6 states have internal predecessors, (997), 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-04-30 10:29:06,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:06,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 206 [2025-04-30 10:29:06,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:07,168 INFO L116 PetriNetUnfolderBase]: 621/3628 cut-off events. [2025-04-30 10:29:07,168 INFO L117 PetriNetUnfolderBase]: For 626/725 co-relation queries the response was YES. [2025-04-30 10:29:07,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6131 conditions, 3628 events. 621/3628 cut-off events. For 626/725 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 29491 event pairs, 81 based on Foata normal form. 20/3444 useless extension candidates. Maximal degree in co-relation 6074. Up to 760 conditions per place. [2025-04-30 10:29:07,185 INFO L140 encePairwiseOnDemand]: 188/206 looper letters, 66 selfloop transitions, 36 changer transitions 0/286 dead transitions. [2025-04-30 10:29:07,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 286 transitions, 1064 flow [2025-04-30 10:29:07,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:07,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1063 transitions. [2025-04-30 10:29:07,187 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.860032362459547 [2025-04-30 10:29:07,187 INFO L175 Difference]: Start difference. First operand has 200 places, 235 transitions, 716 flow. Second operand 6 states and 1063 transitions. [2025-04-30 10:29:07,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 286 transitions, 1064 flow [2025-04-30 10:29:07,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 286 transitions, 1064 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:07,198 INFO L231 Difference]: Finished difference. Result has 210 places, 270 transitions, 1016 flow [2025-04-30 10:29:07,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1016, PETRI_PLACES=210, PETRI_TRANSITIONS=270} [2025-04-30 10:29:07,199 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 11 predicate places. [2025-04-30 10:29:07,199 INFO L485 AbstractCegarLoop]: Abstraction has has 210 places, 270 transitions, 1016 flow [2025-04-30 10:29:07,199 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 166.16666666666666) internal successors, (997), 6 states have internal predecessors, (997), 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-04-30 10:29:07,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:07,200 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:29:07,200 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:29:07,200 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:29:07,200 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:07,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1788007723, now seen corresponding path program 1 times [2025-04-30 10:29:07,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:07,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773102157] [2025-04-30 10:29:07,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:07,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:07,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-30 10:29:07,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-30 10:29:07,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:07,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:07,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:07,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:07,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773102157] [2025-04-30 10:29:07,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773102157] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:07,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:07,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:07,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257712512] [2025-04-30 10:29:07,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:07,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:07,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:07,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:07,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:07,591 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 206 [2025-04-30 10:29:07,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 270 transitions, 1016 flow. Second operand has 6 states, 6 states have (on average 148.0) internal successors, (888), 6 states have internal predecessors, (888), 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-04-30 10:29:07,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:07,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 206 [2025-04-30 10:29:07,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:08,503 INFO L116 PetriNetUnfolderBase]: 2543/8386 cut-off events. [2025-04-30 10:29:08,503 INFO L117 PetriNetUnfolderBase]: For 4773/5071 co-relation queries the response was YES. [2025-04-30 10:29:08,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19147 conditions, 8386 events. 2543/8386 cut-off events. For 4773/5071 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 71152 event pairs, 840 based on Foata normal form. 115/8034 useless extension candidates. Maximal degree in co-relation 19085. Up to 4332 conditions per place. [2025-04-30 10:29:08,547 INFO L140 encePairwiseOnDemand]: 175/206 looper letters, 129 selfloop transitions, 153 changer transitions 0/426 dead transitions. [2025-04-30 10:29:08,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 426 transitions, 2276 flow [2025-04-30 10:29:08,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1033 transitions. [2025-04-30 10:29:08,550 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8357605177993528 [2025-04-30 10:29:08,550 INFO L175 Difference]: Start difference. First operand has 210 places, 270 transitions, 1016 flow. Second operand 6 states and 1033 transitions. [2025-04-30 10:29:08,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 426 transitions, 2276 flow [2025-04-30 10:29:08,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 426 transitions, 2276 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:08,572 INFO L231 Difference]: Finished difference. Result has 220 places, 413 transitions, 2406 flow [2025-04-30 10:29:08,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2406, PETRI_PLACES=220, PETRI_TRANSITIONS=413} [2025-04-30 10:29:08,573 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 21 predicate places. [2025-04-30 10:29:08,573 INFO L485 AbstractCegarLoop]: Abstraction has has 220 places, 413 transitions, 2406 flow [2025-04-30 10:29:08,574 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.0) internal successors, (888), 6 states have internal predecessors, (888), 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-04-30 10:29:08,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:08,574 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] [2025-04-30 10:29:08,574 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:29:08,574 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:29:08,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:08,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1100944048, now seen corresponding path program 1 times [2025-04-30 10:29:08,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:08,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041985966] [2025-04-30 10:29:08,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:08,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:08,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-04-30 10:29:08,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-04-30 10:29:08,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:08,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:09,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:09,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:09,124 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041985966] [2025-04-30 10:29:09,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041985966] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:09,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:09,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:29:09,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428953007] [2025-04-30 10:29:09,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:09,125 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:29:09,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:09,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:29:09,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:29:09,680 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-04-30 10:29:09,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 413 transitions, 2406 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:09,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:09,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-04-30 10:29:09,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:10,704 INFO L116 PetriNetUnfolderBase]: 2180/9618 cut-off events. [2025-04-30 10:29:10,704 INFO L117 PetriNetUnfolderBase]: For 7906/8721 co-relation queries the response was YES. [2025-04-30 10:29:10,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22767 conditions, 9618 events. 2180/9618 cut-off events. For 7906/8721 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 98816 event pairs, 123 based on Foata normal form. 47/9224 useless extension candidates. Maximal degree in co-relation 22702. Up to 2012 conditions per place. [2025-04-30 10:29:10,748 INFO L140 encePairwiseOnDemand]: 193/206 looper letters, 46 selfloop transitions, 18 changer transitions 0/456 dead transitions. [2025-04-30 10:29:10,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 456 transitions, 2682 flow [2025-04-30 10:29:10,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:29:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:29:10,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1493 transitions. [2025-04-30 10:29:10,751 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9059466019417476 [2025-04-30 10:29:10,751 INFO L175 Difference]: Start difference. First operand has 220 places, 413 transitions, 2406 flow. Second operand 8 states and 1493 transitions. [2025-04-30 10:29:10,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 456 transitions, 2682 flow [2025-04-30 10:29:10,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 456 transitions, 2542 flow, removed 70 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:10,788 INFO L231 Difference]: Finished difference. Result has 231 places, 425 transitions, 2387 flow [2025-04-30 10:29:10,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=2274, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2387, PETRI_PLACES=231, PETRI_TRANSITIONS=425} [2025-04-30 10:29:10,789 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 32 predicate places. [2025-04-30 10:29:10,789 INFO L485 AbstractCegarLoop]: Abstraction has has 231 places, 425 transitions, 2387 flow [2025-04-30 10:29:10,789 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:10,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:10,790 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] [2025-04-30 10:29:10,790 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:29:10,790 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:29:10,790 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:10,790 INFO L85 PathProgramCache]: Analyzing trace with hash 209038098, now seen corresponding path program 2 times [2025-04-30 10:29:10,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:10,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921979767] [2025-04-30 10:29:10,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:29:10,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:10,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 1 equivalence classes. [2025-04-30 10:29:10,817 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-04-30 10:29:10,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:29:10,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:11,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:11,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:11,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921979767] [2025-04-30 10:29:11,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921979767] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:11,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:11,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:29:11,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989466508] [2025-04-30 10:29:11,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:11,171 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:29:11,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:11,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:29:11,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:29:11,590 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-04-30 10:29:11,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 425 transitions, 2387 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:11,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:11,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-04-30 10:29:11,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:12,517 INFO L116 PetriNetUnfolderBase]: 2780/11501 cut-off events. [2025-04-30 10:29:12,518 INFO L117 PetriNetUnfolderBase]: For 10184/11312 co-relation queries the response was YES. [2025-04-30 10:29:12,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28733 conditions, 11501 events. 2780/11501 cut-off events. For 10184/11312 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 116340 event pairs, 118 based on Foata normal form. 125/11139 useless extension candidates. Maximal degree in co-relation 28662. Up to 2384 conditions per place. [2025-04-30 10:29:12,580 INFO L140 encePairwiseOnDemand]: 194/206 looper letters, 53 selfloop transitions, 22 changer transitions 0/467 dead transitions. [2025-04-30 10:29:12,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 467 transitions, 2765 flow [2025-04-30 10:29:12,581 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:29:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:29:12,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1488 transitions. [2025-04-30 10:29:12,583 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9029126213592233 [2025-04-30 10:29:12,583 INFO L175 Difference]: Start difference. First operand has 231 places, 425 transitions, 2387 flow. Second operand 8 states and 1488 transitions. [2025-04-30 10:29:12,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 467 transitions, 2765 flow [2025-04-30 10:29:12,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 467 transitions, 2728 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:29:12,626 INFO L231 Difference]: Finished difference. Result has 238 places, 434 transitions, 2491 flow [2025-04-30 10:29:12,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=2376, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2491, PETRI_PLACES=238, PETRI_TRANSITIONS=434} [2025-04-30 10:29:12,628 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 39 predicate places. [2025-04-30 10:29:12,629 INFO L485 AbstractCegarLoop]: Abstraction has has 238 places, 434 transitions, 2491 flow [2025-04-30 10:29:12,629 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:12,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:12,630 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] [2025-04-30 10:29:12,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:29:12,630 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:29:12,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:12,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1912589080, now seen corresponding path program 3 times [2025-04-30 10:29:12,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:12,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593461684] [2025-04-30 10:29:12,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:29:12,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:12,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 85 statements into 1 equivalence classes. [2025-04-30 10:29:12,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-04-30 10:29:12,654 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:29:12,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:13,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:13,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593461684] [2025-04-30 10:29:13,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593461684] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:13,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:13,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:29:13,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188084664] [2025-04-30 10:29:13,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:13,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:29:13,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:13,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:29:13,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:29:13,544 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-04-30 10:29:13,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 434 transitions, 2491 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:13,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:13,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-04-30 10:29:13,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:15,031 INFO L116 PetriNetUnfolderBase]: 3519/14711 cut-off events. [2025-04-30 10:29:15,032 INFO L117 PetriNetUnfolderBase]: For 15994/17494 co-relation queries the response was YES. [2025-04-30 10:29:15,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38238 conditions, 14711 events. 3519/14711 cut-off events. For 15994/17494 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 159432 event pairs, 146 based on Foata normal form. 133/14225 useless extension candidates. Maximal degree in co-relation 38164. Up to 3137 conditions per place. [2025-04-30 10:29:15,106 INFO L140 encePairwiseOnDemand]: 193/206 looper letters, 72 selfloop transitions, 24 changer transitions 0/488 dead transitions. [2025-04-30 10:29:15,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 488 transitions, 3053 flow [2025-04-30 10:29:15,107 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:29:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:29:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1499 transitions. [2025-04-30 10:29:15,109 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9095873786407767 [2025-04-30 10:29:15,109 INFO L175 Difference]: Start difference. First operand has 238 places, 434 transitions, 2491 flow. Second operand 8 states and 1499 transitions. [2025-04-30 10:29:15,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 488 transitions, 3053 flow [2025-04-30 10:29:15,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 488 transitions, 2994 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-04-30 10:29:15,164 INFO L231 Difference]: Finished difference. Result has 247 places, 452 transitions, 2702 flow [2025-04-30 10:29:15,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=2466, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2702, PETRI_PLACES=247, PETRI_TRANSITIONS=452} [2025-04-30 10:29:15,167 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 48 predicate places. [2025-04-30 10:29:15,167 INFO L485 AbstractCegarLoop]: Abstraction has has 247 places, 452 transitions, 2702 flow [2025-04-30 10:29:15,168 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:15,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:15,169 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] [2025-04-30 10:29:15,169 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:29:15,169 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:29:15,169 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:15,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1091058510, now seen corresponding path program 4 times [2025-04-30 10:29:15,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:15,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423461241] [2025-04-30 10:29:15,170 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:29:15,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:15,185 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-04-30 10:29:15,196 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 77 of 85 statements. [2025-04-30 10:29:15,199 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:29:15,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:15,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:15,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423461241] [2025-04-30 10:29:15,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423461241] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:15,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:15,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:29:15,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437139440] [2025-04-30 10:29:15,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:15,426 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:29:15,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:15,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:29:15,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:29:15,878 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-04-30 10:29:15,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 452 transitions, 2702 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:15,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:15,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-04-30 10:29:15,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:17,495 INFO L116 PetriNetUnfolderBase]: 4241/17376 cut-off events. [2025-04-30 10:29:17,495 INFO L117 PetriNetUnfolderBase]: For 23515/25523 co-relation queries the response was YES. [2025-04-30 10:29:17,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46218 conditions, 17376 events. 4241/17376 cut-off events. For 23515/25523 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 195232 event pairs, 173 based on Foata normal form. 198/16847 useless extension candidates. Maximal degree in co-relation 46139. Up to 3675 conditions per place. [2025-04-30 10:29:17,602 INFO L140 encePairwiseOnDemand]: 192/206 looper letters, 78 selfloop transitions, 43 changer transitions 0/513 dead transitions. [2025-04-30 10:29:17,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 513 transitions, 3446 flow [2025-04-30 10:29:17,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:29:17,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:29:17,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1494 transitions. [2025-04-30 10:29:17,605 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9065533980582524 [2025-04-30 10:29:17,605 INFO L175 Difference]: Start difference. First operand has 247 places, 452 transitions, 2702 flow. Second operand 8 states and 1494 transitions. [2025-04-30 10:29:17,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 513 transitions, 3446 flow [2025-04-30 10:29:17,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 513 transitions, 3397 flow, removed 24 selfloop flow, removed 1 redundant places. [2025-04-30 10:29:17,683 INFO L231 Difference]: Finished difference. Result has 257 places, 476 transitions, 3025 flow [2025-04-30 10:29:17,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=2663, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3025, PETRI_PLACES=257, PETRI_TRANSITIONS=476} [2025-04-30 10:29:17,684 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 58 predicate places. [2025-04-30 10:29:17,684 INFO L485 AbstractCegarLoop]: Abstraction has has 257 places, 476 transitions, 3025 flow [2025-04-30 10:29:17,685 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:17,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:17,685 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] [2025-04-30 10:29:17,685 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:29:17,685 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:29:17,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:17,686 INFO L85 PathProgramCache]: Analyzing trace with hash 623580520, now seen corresponding path program 5 times [2025-04-30 10:29:17,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:17,686 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165404787] [2025-04-30 10:29:17,686 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:29:17,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:17,704 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 85 statements into 1 equivalence classes. [2025-04-30 10:29:17,715 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-04-30 10:29:17,716 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:29:17,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:18,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:18,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165404787] [2025-04-30 10:29:18,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165404787] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:18,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:18,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:29:18,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578033018] [2025-04-30 10:29:18,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:18,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:29:18,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:18,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:29:18,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:29:18,587 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-04-30 10:29:18,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 476 transitions, 3025 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:18,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:18,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-04-30 10:29:18,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:20,608 INFO L116 PetriNetUnfolderBase]: 4242/17651 cut-off events. [2025-04-30 10:29:20,609 INFO L117 PetriNetUnfolderBase]: For 31204/33339 co-relation queries the response was YES. [2025-04-30 10:29:20,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49161 conditions, 17651 events. 4242/17651 cut-off events. For 31204/33339 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 199652 event pairs, 174 based on Foata normal form. 184/17101 useless extension candidates. Maximal degree in co-relation 49077. Up to 3725 conditions per place. [2025-04-30 10:29:20,742 INFO L140 encePairwiseOnDemand]: 192/206 looper letters, 96 selfloop transitions, 34 changer transitions 0/522 dead transitions. [2025-04-30 10:29:20,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 522 transitions, 3741 flow [2025-04-30 10:29:20,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:29:20,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:29:20,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1501 transitions. [2025-04-30 10:29:20,746 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9108009708737864 [2025-04-30 10:29:20,746 INFO L175 Difference]: Start difference. First operand has 257 places, 476 transitions, 3025 flow. Second operand 8 states and 1501 transitions. [2025-04-30 10:29:20,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 522 transitions, 3741 flow [2025-04-30 10:29:20,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 522 transitions, 3638 flow, removed 24 selfloop flow, removed 3 redundant places. [2025-04-30 10:29:20,834 INFO L231 Difference]: Finished difference. Result has 264 places, 492 transitions, 3228 flow [2025-04-30 10:29:20,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=2940, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3228, PETRI_PLACES=264, PETRI_TRANSITIONS=492} [2025-04-30 10:29:20,835 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 65 predicate places. [2025-04-30 10:29:20,835 INFO L485 AbstractCegarLoop]: Abstraction has has 264 places, 492 transitions, 3228 flow [2025-04-30 10:29:20,835 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:20,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:20,835 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] [2025-04-30 10:29:20,835 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:29:20,836 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:29:20,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:20,836 INFO L85 PathProgramCache]: Analyzing trace with hash -185657544, now seen corresponding path program 6 times [2025-04-30 10:29:20,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:20,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271397007] [2025-04-30 10:29:20,836 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:29:20,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:20,847 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 85 statements into 1 equivalence classes. [2025-04-30 10:29:20,855 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-04-30 10:29:20,856 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-30 10:29:20,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:21,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:21,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271397007] [2025-04-30 10:29:21,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271397007] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:21,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:21,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:29:21,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019206870] [2025-04-30 10:29:21,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:21,107 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:29:21,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:21,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:29:21,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:29:21,520 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-04-30 10:29:21,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 492 transitions, 3228 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:21,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:21,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-04-30 10:29:21,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:23,476 INFO L116 PetriNetUnfolderBase]: 4291/18067 cut-off events. [2025-04-30 10:29:23,476 INFO L117 PetriNetUnfolderBase]: For 36539/38777 co-relation queries the response was YES. [2025-04-30 10:29:23,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50489 conditions, 18067 events. 4291/18067 cut-off events. For 36539/38777 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 205993 event pairs, 185 based on Foata normal form. 324/17614 useless extension candidates. Maximal degree in co-relation 50402. Up to 3872 conditions per place. [2025-04-30 10:29:23,604 INFO L140 encePairwiseOnDemand]: 193/206 looper letters, 101 selfloop transitions, 43 changer transitions 0/536 dead transitions. [2025-04-30 10:29:23,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 536 transitions, 4005 flow [2025-04-30 10:29:23,605 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:29:23,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:29:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1496 transitions. [2025-04-30 10:29:23,607 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9077669902912622 [2025-04-30 10:29:23,607 INFO L175 Difference]: Start difference. First operand has 264 places, 492 transitions, 3228 flow. Second operand 8 states and 1496 transitions. [2025-04-30 10:29:23,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 536 transitions, 4005 flow [2025-04-30 10:29:23,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 536 transitions, 3954 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-04-30 10:29:23,700 INFO L231 Difference]: Finished difference. Result has 272 places, 509 transitions, 3558 flow [2025-04-30 10:29:23,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=3181, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3558, PETRI_PLACES=272, PETRI_TRANSITIONS=509} [2025-04-30 10:29:23,701 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 73 predicate places. [2025-04-30 10:29:23,701 INFO L485 AbstractCegarLoop]: Abstraction has has 272 places, 509 transitions, 3558 flow [2025-04-30 10:29:23,702 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:23,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:23,702 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] [2025-04-30 10:29:23,702 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:29:23,702 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:29:23,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:23,703 INFO L85 PathProgramCache]: Analyzing trace with hash -707285484, now seen corresponding path program 7 times [2025-04-30 10:29:23,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:23,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604314857] [2025-04-30 10:29:23,703 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:29:23,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:23,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-04-30 10:29:23,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-04-30 10:29:23,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:23,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:23,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:23,932 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604314857] [2025-04-30 10:29:23,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604314857] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:23,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:23,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:29:23,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224944949] [2025-04-30 10:29:23,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:23,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:29:23,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:23,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:29:23,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:29:24,266 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-04-30 10:29:24,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 509 transitions, 3558 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:24,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:24,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-04-30 10:29:24,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:26,593 INFO L116 PetriNetUnfolderBase]: 4290/18010 cut-off events. [2025-04-30 10:29:26,594 INFO L117 PetriNetUnfolderBase]: For 44330/46768 co-relation queries the response was YES. [2025-04-30 10:29:26,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51799 conditions, 18010 events. 4290/18010 cut-off events. For 44330/46768 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 204877 event pairs, 174 based on Foata normal form. 355/17599 useless extension candidates. Maximal degree in co-relation 51707. Up to 3822 conditions per place. [2025-04-30 10:29:26,749 INFO L140 encePairwiseOnDemand]: 193/206 looper letters, 116 selfloop transitions, 45 changer transitions 0/553 dead transitions. [2025-04-30 10:29:26,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 553 transitions, 4347 flow [2025-04-30 10:29:26,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:29:26,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:29:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1495 transitions. [2025-04-30 10:29:26,751 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9071601941747572 [2025-04-30 10:29:26,751 INFO L175 Difference]: Start difference. First operand has 272 places, 509 transitions, 3558 flow. Second operand 8 states and 1495 transitions. [2025-04-30 10:29:26,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 553 transitions, 4347 flow [2025-04-30 10:29:26,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 553 transitions, 4255 flow, removed 39 selfloop flow, removed 2 redundant places. [2025-04-30 10:29:26,883 INFO L231 Difference]: Finished difference. Result has 281 places, 519 transitions, 3759 flow [2025-04-30 10:29:26,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=3466, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3759, PETRI_PLACES=281, PETRI_TRANSITIONS=519} [2025-04-30 10:29:26,884 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 82 predicate places. [2025-04-30 10:29:26,884 INFO L485 AbstractCegarLoop]: Abstraction has has 281 places, 519 transitions, 3759 flow [2025-04-30 10:29:26,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:26,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:26,884 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] [2025-04-30 10:29:26,884 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:29:26,885 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:29:26,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:26,885 INFO L85 PathProgramCache]: Analyzing trace with hash 107456854, now seen corresponding path program 8 times [2025-04-30 10:29:26,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:26,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108277665] [2025-04-30 10:29:26,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:29:26,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:26,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 1 equivalence classes. [2025-04-30 10:29:26,902 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-04-30 10:29:26,902 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:29:26,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:27,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:27,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108277665] [2025-04-30 10:29:27,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108277665] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:27,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:27,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:29:27,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390096580] [2025-04-30 10:29:27,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:27,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:29:27,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:27,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:29:27,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:29:27,586 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-04-30 10:29:27,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 519 transitions, 3759 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:27,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:27,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-04-30 10:29:27,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:29,221 INFO L116 PetriNetUnfolderBase]: 3629/15707 cut-off events. [2025-04-30 10:29:29,221 INFO L117 PetriNetUnfolderBase]: For 45014/47122 co-relation queries the response was YES. [2025-04-30 10:29:29,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45878 conditions, 15707 events. 3629/15707 cut-off events. For 45014/47122 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 173388 event pairs, 143 based on Foata normal form. 240/15264 useless extension candidates. Maximal degree in co-relation 45782. Up to 3318 conditions per place. [2025-04-30 10:29:29,356 INFO L140 encePairwiseOnDemand]: 192/206 looper letters, 113 selfloop transitions, 48 changer transitions 0/553 dead transitions. [2025-04-30 10:29:29,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 553 transitions, 4518 flow [2025-04-30 10:29:29,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:29:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:29:29,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1497 transitions. [2025-04-30 10:29:29,359 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.908373786407767 [2025-04-30 10:29:29,359 INFO L175 Difference]: Start difference. First operand has 281 places, 519 transitions, 3759 flow. Second operand 8 states and 1497 transitions. [2025-04-30 10:29:29,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 553 transitions, 4518 flow [2025-04-30 10:29:29,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 553 transitions, 4428 flow, removed 32 selfloop flow, removed 3 redundant places. [2025-04-30 10:29:29,462 INFO L231 Difference]: Finished difference. Result has 288 places, 532 transitions, 4035 flow [2025-04-30 10:29:29,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=3648, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4035, PETRI_PLACES=288, PETRI_TRANSITIONS=532} [2025-04-30 10:29:29,463 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 89 predicate places. [2025-04-30 10:29:29,463 INFO L485 AbstractCegarLoop]: Abstraction has has 288 places, 532 transitions, 4035 flow [2025-04-30 10:29:29,464 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:29,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:29,464 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] [2025-04-30 10:29:29,464 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:29:29,464 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:29:29,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:29,465 INFO L85 PathProgramCache]: Analyzing trace with hash 877248454, now seen corresponding path program 9 times [2025-04-30 10:29:29,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:29,465 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499150727] [2025-04-30 10:29:29,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:29:29,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:29,472 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 85 statements into 1 equivalence classes. [2025-04-30 10:29:29,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-04-30 10:29:29,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:29:29,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:29,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:29,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499150727] [2025-04-30 10:29:29,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499150727] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:29,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:29,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:29:29,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301093390] [2025-04-30 10:29:29,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:29,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:29:29,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:29,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:29:29,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:29:30,068 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-04-30 10:29:30,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 532 transitions, 4035 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:30,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:30,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-04-30 10:29:30,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:31,858 INFO L116 PetriNetUnfolderBase]: 3697/15818 cut-off events. [2025-04-30 10:29:31,858 INFO L117 PetriNetUnfolderBase]: For 47191/49483 co-relation queries the response was YES. [2025-04-30 10:29:31,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46549 conditions, 15818 events. 3697/15818 cut-off events. For 47191/49483 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 172265 event pairs, 135 based on Foata normal form. 508/15628 useless extension candidates. Maximal degree in co-relation 46450. Up to 3297 conditions per place. [2025-04-30 10:29:31,963 INFO L140 encePairwiseOnDemand]: 194/206 looper letters, 99 selfloop transitions, 81 changer transitions 0/572 dead transitions. [2025-04-30 10:29:31,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 572 transitions, 5030 flow [2025-04-30 10:29:31,964 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:29:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:29:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1488 transitions. [2025-04-30 10:29:31,965 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9029126213592233 [2025-04-30 10:29:31,966 INFO L175 Difference]: Start difference. First operand has 288 places, 532 transitions, 4035 flow. Second operand 8 states and 1488 transitions. [2025-04-30 10:29:31,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 572 transitions, 5030 flow [2025-04-30 10:29:32,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 572 transitions, 4919 flow, removed 24 selfloop flow, removed 4 redundant places. [2025-04-30 10:29:32,068 INFO L231 Difference]: Finished difference. Result has 294 places, 540 transitions, 4292 flow [2025-04-30 10:29:32,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=3934, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4292, PETRI_PLACES=294, PETRI_TRANSITIONS=540} [2025-04-30 10:29:32,069 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 95 predicate places. [2025-04-30 10:29:32,069 INFO L485 AbstractCegarLoop]: Abstraction has has 294 places, 540 transitions, 4292 flow [2025-04-30 10:29:32,070 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:32,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:32,070 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] [2025-04-30 10:29:32,070 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:29:32,070 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:29:32,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:32,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1897693060, now seen corresponding path program 10 times [2025-04-30 10:29:32,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:32,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692119200] [2025-04-30 10:29:32,071 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:29:32,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:32,078 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-04-30 10:29:32,084 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 77 of 85 statements. [2025-04-30 10:29:32,084 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:29:32,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:32,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:32,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:32,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692119200] [2025-04-30 10:29:32,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692119200] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:32,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:32,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:29:32,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935558681] [2025-04-30 10:29:32,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:32,239 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:29:32,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:32,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:29:32,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:29:32,637 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-04-30 10:29:32,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 540 transitions, 4292 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:32,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:32,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-04-30 10:29:32,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:34,086 INFO L116 PetriNetUnfolderBase]: 3113/14045 cut-off events. [2025-04-30 10:29:34,086 INFO L117 PetriNetUnfolderBase]: For 48409/50593 co-relation queries the response was YES. [2025-04-30 10:29:34,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42027 conditions, 14045 events. 3113/14045 cut-off events. For 48409/50593 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 149441 event pairs, 118 based on Foata normal form. 332/13761 useless extension candidates. Maximal degree in co-relation 41925. Up to 2878 conditions per place. [2025-04-30 10:29:34,240 INFO L140 encePairwiseOnDemand]: 192/206 looper letters, 121 selfloop transitions, 62 changer transitions 0/575 dead transitions. [2025-04-30 10:29:34,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 575 transitions, 5160 flow [2025-04-30 10:29:34,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:29:34,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:29:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1493 transitions. [2025-04-30 10:29:34,243 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9059466019417476 [2025-04-30 10:29:34,243 INFO L175 Difference]: Start difference. First operand has 294 places, 540 transitions, 4292 flow. Second operand 8 states and 1493 transitions. [2025-04-30 10:29:34,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 575 transitions, 5160 flow [2025-04-30 10:29:34,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 575 transitions, 5009 flow, removed 49 selfloop flow, removed 3 redundant places. [2025-04-30 10:29:34,380 INFO L231 Difference]: Finished difference. Result has 301 places, 553 transitions, 4529 flow [2025-04-30 10:29:34,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=4107, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4529, PETRI_PLACES=301, PETRI_TRANSITIONS=553} [2025-04-30 10:29:34,381 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 102 predicate places. [2025-04-30 10:29:34,381 INFO L485 AbstractCegarLoop]: Abstraction has has 301 places, 553 transitions, 4529 flow [2025-04-30 10:29:34,382 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:34,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:34,382 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] [2025-04-30 10:29:34,382 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:29:34,382 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:29:34,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:34,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1348287372, now seen corresponding path program 11 times [2025-04-30 10:29:34,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:34,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057549130] [2025-04-30 10:29:34,383 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:29:34,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:34,390 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 85 statements into 1 equivalence classes. [2025-04-30 10:29:34,394 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-04-30 10:29:34,394 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:29:34,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:34,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:34,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:34,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057549130] [2025-04-30 10:29:34,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057549130] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:34,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:34,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:29:34,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920952570] [2025-04-30 10:29:34,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:34,556 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:29:34,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:34,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:29:34,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:29:34,937 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-04-30 10:29:34,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 553 transitions, 4529 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:34,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:34,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-04-30 10:29:34,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:36,431 INFO L116 PetriNetUnfolderBase]: 3113/14010 cut-off events. [2025-04-30 10:29:36,431 INFO L117 PetriNetUnfolderBase]: For 55763/58073 co-relation queries the response was YES. [2025-04-30 10:29:36,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42625 conditions, 14010 events. 3113/14010 cut-off events. For 55763/58073 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 148831 event pairs, 109 based on Foata normal form. 308/13709 useless extension candidates. Maximal degree in co-relation 42520. Up to 2853 conditions per place. [2025-04-30 10:29:36,564 INFO L140 encePairwiseOnDemand]: 193/206 looper letters, 162 selfloop transitions, 33 changer transitions 0/587 dead transitions. [2025-04-30 10:29:36,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 587 transitions, 5396 flow [2025-04-30 10:29:36,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:29:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:29:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1499 transitions. [2025-04-30 10:29:36,566 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9095873786407767 [2025-04-30 10:29:36,566 INFO L175 Difference]: Start difference. First operand has 301 places, 553 transitions, 4529 flow. Second operand 8 states and 1499 transitions. [2025-04-30 10:29:36,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 587 transitions, 5396 flow [2025-04-30 10:29:36,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 587 transitions, 5299 flow, removed 24 selfloop flow, removed 3 redundant places. [2025-04-30 10:29:36,704 INFO L231 Difference]: Finished difference. Result has 309 places, 563 transitions, 4709 flow [2025-04-30 10:29:36,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=4444, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4709, PETRI_PLACES=309, PETRI_TRANSITIONS=563} [2025-04-30 10:29:36,704 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 110 predicate places. [2025-04-30 10:29:36,704 INFO L485 AbstractCegarLoop]: Abstraction has has 309 places, 563 transitions, 4709 flow [2025-04-30 10:29:36,705 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:36,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:36,705 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] [2025-04-30 10:29:36,705 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:29:36,705 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:29:36,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:36,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1449895044, now seen corresponding path program 12 times [2025-04-30 10:29:36,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:36,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924688689] [2025-04-30 10:29:36,706 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:29:36,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:36,713 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 85 statements into 1 equivalence classes. [2025-04-30 10:29:36,716 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-04-30 10:29:36,717 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-30 10:29:36,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:36,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:36,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:36,880 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924688689] [2025-04-30 10:29:36,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924688689] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:36,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:36,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:29:36,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083200607] [2025-04-30 10:29:36,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:36,881 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:29:36,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:36,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:29:36,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:29:37,309 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-04-30 10:29:37,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 563 transitions, 4709 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:37,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:37,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-04-30 10:29:37,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:38,908 INFO L116 PetriNetUnfolderBase]: 3143/14377 cut-off events. [2025-04-30 10:29:38,908 INFO L117 PetriNetUnfolderBase]: For 56156/58493 co-relation queries the response was YES. [2025-04-30 10:29:38,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43711 conditions, 14377 events. 3143/14377 cut-off events. For 56156/58493 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 153943 event pairs, 116 based on Foata normal form. 282/14032 useless extension candidates. Maximal degree in co-relation 43602. Up to 2928 conditions per place. [2025-04-30 10:29:39,011 INFO L140 encePairwiseOnDemand]: 192/206 looper letters, 157 selfloop transitions, 48 changer transitions 0/597 dead transitions. [2025-04-30 10:29:39,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 597 transitions, 5675 flow [2025-04-30 10:29:39,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:29:39,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:29:39,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1498 transitions. [2025-04-30 10:29:39,013 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9089805825242718 [2025-04-30 10:29:39,013 INFO L175 Difference]: Start difference. First operand has 309 places, 563 transitions, 4709 flow. Second operand 8 states and 1498 transitions. [2025-04-30 10:29:39,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 597 transitions, 5675 flow [2025-04-30 10:29:39,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 597 transitions, 5511 flow, removed 66 selfloop flow, removed 3 redundant places. [2025-04-30 10:29:39,141 INFO L231 Difference]: Finished difference. Result has 316 places, 579 transitions, 5035 flow [2025-04-30 10:29:39,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=4627, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5035, PETRI_PLACES=316, PETRI_TRANSITIONS=579} [2025-04-30 10:29:39,142 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 117 predicate places. [2025-04-30 10:29:39,142 INFO L485 AbstractCegarLoop]: Abstraction has has 316 places, 579 transitions, 5035 flow [2025-04-30 10:29:39,143 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:39,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:39,143 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] [2025-04-30 10:29:39,143 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:29:39,143 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:29:39,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:39,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2029749146, now seen corresponding path program 13 times [2025-04-30 10:29:39,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:39,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241241843] [2025-04-30 10:29:39,144 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:29:39,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:39,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-04-30 10:29:39,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-04-30 10:29:39,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:39,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:39,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:39,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:39,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241241843] [2025-04-30 10:29:39,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241241843] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:39,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:39,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:29:39,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211746334] [2025-04-30 10:29:39,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:39,329 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:29:39,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:39,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:29:39,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:29:39,752 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-04-30 10:29:39,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 579 transitions, 5035 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:39,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:39,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-04-30 10:29:39,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:41,193 INFO L116 PetriNetUnfolderBase]: 2487/12117 cut-off events. [2025-04-30 10:29:41,193 INFO L117 PetriNetUnfolderBase]: For 44741/46575 co-relation queries the response was YES. [2025-04-30 10:29:41,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36193 conditions, 12117 events. 2487/12117 cut-off events. For 44741/46575 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 126236 event pairs, 95 based on Foata normal form. 228/11798 useless extension candidates. Maximal degree in co-relation 36081. Up to 2447 conditions per place. [2025-04-30 10:29:41,321 INFO L140 encePairwiseOnDemand]: 192/206 looper letters, 161 selfloop transitions, 50 changer transitions 0/603 dead transitions. [2025-04-30 10:29:41,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 603 transitions, 5833 flow [2025-04-30 10:29:41,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:29:41,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:29:41,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1501 transitions. [2025-04-30 10:29:41,323 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9108009708737864 [2025-04-30 10:29:41,323 INFO L175 Difference]: Start difference. First operand has 316 places, 579 transitions, 5035 flow. Second operand 8 states and 1501 transitions. [2025-04-30 10:29:41,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 603 transitions, 5833 flow [2025-04-30 10:29:41,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 603 transitions, 5708 flow, removed 33 selfloop flow, removed 4 redundant places. [2025-04-30 10:29:41,445 INFO L231 Difference]: Finished difference. Result has 322 places, 592 transitions, 5312 flow [2025-04-30 10:29:41,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=4871, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5312, PETRI_PLACES=322, PETRI_TRANSITIONS=592} [2025-04-30 10:29:41,445 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 123 predicate places. [2025-04-30 10:29:41,445 INFO L485 AbstractCegarLoop]: Abstraction has has 322 places, 592 transitions, 5312 flow [2025-04-30 10:29:41,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:41,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:41,446 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] [2025-04-30 10:29:41,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:29:41,446 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:29:41,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:41,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1718005252, now seen corresponding path program 14 times [2025-04-30 10:29:41,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:41,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477828513] [2025-04-30 10:29:41,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:29:41,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:41,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 1 equivalence classes. [2025-04-30 10:29:41,458 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-04-30 10:29:41,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:29:41,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:41,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:41,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:41,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477828513] [2025-04-30 10:29:41,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477828513] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:41,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:41,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:29:41,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496247612] [2025-04-30 10:29:41,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:41,626 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:29:41,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:41,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:29:41,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:29:41,964 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2025-04-30 10:29:41,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 592 transitions, 5312 flow. Second operand has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:41,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:41,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2025-04-30 10:29:41,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:42,419 INFO L116 PetriNetUnfolderBase]: 355/3863 cut-off events. [2025-04-30 10:29:42,419 INFO L117 PetriNetUnfolderBase]: For 16177/16376 co-relation queries the response was YES. [2025-04-30 10:29:42,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10937 conditions, 3863 events. 355/3863 cut-off events. For 16177/16376 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 35969 event pairs, 13 based on Foata normal form. 73/3761 useless extension candidates. Maximal degree in co-relation 10822. Up to 738 conditions per place. [2025-04-30 10:29:42,460 INFO L140 encePairwiseOnDemand]: 195/206 looper letters, 118 selfloop transitions, 82 changer transitions 0/373 dead transitions. [2025-04-30 10:29:42,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 373 transitions, 4036 flow [2025-04-30 10:29:42,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:29:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:29:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1491 transitions. [2025-04-30 10:29:42,462 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9047330097087378 [2025-04-30 10:29:42,462 INFO L175 Difference]: Start difference. First operand has 322 places, 592 transitions, 5312 flow. Second operand 8 states and 1491 transitions. [2025-04-30 10:29:42,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 373 transitions, 4036 flow [2025-04-30 10:29:42,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 373 transitions, 3529 flow, removed 128 selfloop flow, removed 18 redundant places. [2025-04-30 10:29:42,514 INFO L231 Difference]: Finished difference. Result has 306 places, 369 transitions, 3318 flow [2025-04-30 10:29:42,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=3034, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3318, PETRI_PLACES=306, PETRI_TRANSITIONS=369} [2025-04-30 10:29:42,515 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 107 predicate places. [2025-04-30 10:29:42,515 INFO L485 AbstractCegarLoop]: Abstraction has has 306 places, 369 transitions, 3318 flow [2025-04-30 10:29:42,515 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 181.375) internal successors, (1451), 8 states have internal predecessors, (1451), 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-04-30 10:29:42,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:42,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:42,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:29:42,516 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting workerErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:29:42,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:42,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1237469579, now seen corresponding path program 1 times [2025-04-30 10:29:42,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:42,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74402779] [2025-04-30 10:29:42,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:42,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:42,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-04-30 10:29:42,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-04-30 10:29:42,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:42,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:42,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:42,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74402779] [2025-04-30 10:29:42,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74402779] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:42,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:42,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:29:42,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918608359] [2025-04-30 10:29:42,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:42,648 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:29:42,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:42,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:29:42,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:29:43,010 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2025-04-30 10:29:43,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 369 transitions, 3318 flow. Second operand has 9 states, 9 states have (on average 175.0) internal successors, (1575), 9 states have internal predecessors, (1575), 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-04-30 10:29:43,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:43,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2025-04-30 10:29:43,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:43,481 INFO L116 PetriNetUnfolderBase]: 417/4634 cut-off events. [2025-04-30 10:29:43,481 INFO L117 PetriNetUnfolderBase]: For 16007/16174 co-relation queries the response was YES. [2025-04-30 10:29:43,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10725 conditions, 4634 events. 417/4634 cut-off events. For 16007/16174 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 41202 event pairs, 11 based on Foata normal form. 124/4576 useless extension candidates. Maximal degree in co-relation 10607. Up to 567 conditions per place. [2025-04-30 10:29:43,516 INFO L140 encePairwiseOnDemand]: 195/206 looper letters, 167 selfloop transitions, 24 changer transitions 0/424 dead transitions. [2025-04-30 10:29:43,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 424 transitions, 4460 flow [2025-04-30 10:29:43,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:29:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:29:43,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1425 transitions. [2025-04-30 10:29:43,519 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8646844660194175 [2025-04-30 10:29:43,519 INFO L175 Difference]: Start difference. First operand has 306 places, 369 transitions, 3318 flow. Second operand 8 states and 1425 transitions. [2025-04-30 10:29:43,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 424 transitions, 4460 flow [2025-04-30 10:29:43,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 424 transitions, 4190 flow, removed 45 selfloop flow, removed 6 redundant places. [2025-04-30 10:29:43,558 INFO L231 Difference]: Finished difference. Result has 311 places, 388 transitions, 3466 flow [2025-04-30 10:29:43,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=3094, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3466, PETRI_PLACES=311, PETRI_TRANSITIONS=388} [2025-04-30 10:29:43,558 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 112 predicate places. [2025-04-30 10:29:43,558 INFO L485 AbstractCegarLoop]: Abstraction has has 311 places, 388 transitions, 3466 flow [2025-04-30 10:29:43,559 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 175.0) internal successors, (1575), 9 states have internal predecessors, (1575), 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-04-30 10:29:43,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:43,559 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] [2025-04-30 10:29:43,559 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:29:43,559 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting workerErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:29:43,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:43,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1243242901, now seen corresponding path program 1 times [2025-04-30 10:29:43,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:43,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608750580] [2025-04-30 10:29:43,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:43,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:43,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-04-30 10:29:43,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-04-30 10:29:43,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:43,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:29:43,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:43,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608750580] [2025-04-30 10:29:43,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608750580] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:43,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:43,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:43,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743318397] [2025-04-30 10:29:43,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:43,763 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:43,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:43,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:43,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:43,909 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 206 [2025-04-30 10:29:43,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 388 transitions, 3466 flow. Second operand has 6 states, 6 states have (on average 148.0) internal successors, (888), 6 states have internal predecessors, (888), 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-04-30 10:29:43,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:43,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 206 [2025-04-30 10:29:43,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:44,521 INFO L116 PetriNetUnfolderBase]: 700/5068 cut-off events. [2025-04-30 10:29:44,521 INFO L117 PetriNetUnfolderBase]: For 26775/27372 co-relation queries the response was YES. [2025-04-30 10:29:44,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14467 conditions, 5068 events. 700/5068 cut-off events. For 26775/27372 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 44024 event pairs, 157 based on Foata normal form. 559/5464 useless extension candidates. Maximal degree in co-relation 14344. Up to 2311 conditions per place. [2025-04-30 10:29:44,556 INFO L140 encePairwiseOnDemand]: 200/206 looper letters, 0 selfloop transitions, 0 changer transitions 387/387 dead transitions. [2025-04-30 10:29:44,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 387 transitions, 3812 flow [2025-04-30 10:29:44,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 898 transitions. [2025-04-30 10:29:44,558 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7265372168284789 [2025-04-30 10:29:44,558 INFO L175 Difference]: Start difference. First operand has 311 places, 388 transitions, 3466 flow. Second operand 6 states and 898 transitions. [2025-04-30 10:29:44,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 387 transitions, 3812 flow [2025-04-30 10:29:44,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 387 transitions, 3806 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:29:44,599 INFO L231 Difference]: Finished difference. Result has 313 places, 0 transitions, 0 flow [2025-04-30 10:29:44,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=3458, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=313, PETRI_TRANSITIONS=0} [2025-04-30 10:29:44,600 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, 114 predicate places. [2025-04-30 10:29:44,600 INFO L485 AbstractCegarLoop]: Abstraction has has 313 places, 0 transitions, 0 flow [2025-04-30 10:29:44,600 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.0) internal successors, (888), 6 states have internal predecessors, (888), 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-04-30 10:29:44,602 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 17 remaining) [2025-04-30 10:29:44,603 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2025-04-30 10:29:44,603 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2025-04-30 10:29:44,603 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2025-04-30 10:29:44,603 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 17 remaining) [2025-04-30 10:29:44,603 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2025-04-30 10:29:44,603 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr2ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2025-04-30 10:29:44,603 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2025-04-30 10:29:44,603 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr3ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2025-04-30 10:29:44,603 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr4ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2025-04-30 10:29:44,603 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr5ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2025-04-30 10:29:44,603 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining) [2025-04-30 10:29:44,603 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr2ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2025-04-30 10:29:44,603 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2025-04-30 10:29:44,603 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr3ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2025-04-30 10:29:44,603 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr4ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2025-04-30 10:29:44,603 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr5ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2025-04-30 10:29:44,603 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:29:44,603 INFO L422 BasicCegarLoop]: Path program histogram: [14, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:44,607 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-30 10:29:44,607 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:29:44,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:29:44 BasicIcfg [2025-04-30 10:29:44,610 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:29:44,611 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:29:44,611 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:29:44,611 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:29:44,612 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:29:03" (3/4) ... [2025-04-30 10:29:44,613 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:29:44,615 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure worker [2025-04-30 10:29:44,617 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-04-30 10:29:44,617 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-30 10:29:44,617 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-30 10:29:44,617 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-30 10:29:44,668 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:29:44,668 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:29:44,668 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:29:44,669 INFO L158 Benchmark]: Toolchain (without parser) took 41774.55ms. Allocated memory was 167.8MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 134.9MB in the beginning and 977.1MB in the end (delta: -842.2MB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2025-04-30 10:29:44,669 INFO L158 Benchmark]: CDTParser took 1.34ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:29:44,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.59ms. Allocated memory is still 167.8MB. Free memory was 134.9MB in the beginning and 111.2MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:29:44,669 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.31ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 108.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:29:44,669 INFO L158 Benchmark]: Boogie Preprocessor took 35.10ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 105.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:29:44,670 INFO L158 Benchmark]: RCFGBuilder took 469.11ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 82.0MB in the end (delta: 23.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:29:44,670 INFO L158 Benchmark]: TraceAbstraction took 40715.52ms. Allocated memory was 167.8MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 81.6MB in the beginning and 985.5MB in the end (delta: -903.9MB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2025-04-30 10:29:44,670 INFO L158 Benchmark]: Witness Printer took 57.41ms. Allocated memory is still 3.1GB. Free memory was 985.5MB in the beginning and 977.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:29:44,671 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.34ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.59ms. Allocated memory is still 167.8MB. Free memory was 134.9MB in the beginning and 111.2MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.31ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 108.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.10ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 105.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 469.11ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 82.0MB in the end (delta: 23.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 40715.52ms. Allocated memory was 167.8MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 81.6MB in the beginning and 985.5MB in the end (delta: -903.9MB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 57.41ms. Allocated memory is still 3.1GB. Free memory was 985.5MB in the beginning and 977.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 714]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 715]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 715]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 723]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 726]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 724]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 727]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 728]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 728]: 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 3 procedures, 297 locations, 313 edges, 17 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: 40.6s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.0s, AutomataDifference: 34.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9647 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7439 mSDsluCounter, 10159 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9327 mSDsCounter, 288 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19364 IncrementalHoareTripleChecker+Invalid, 19652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 288 mSolverCounterUnsat, 832 mSDtfsCounter, 19364 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5312occurred in iteration=17, InterpolantAutomatonStates: 150, 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.2s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1633 NumberOfCodeBlocks, 1617 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1613 ConstructedInterpolants, 0 QuantifiedInterpolants, 6002 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 10/10 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 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-30 10:29:44,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE