./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a107795e01eed1ee79fba30cb5022ee32b5d5a3711e8a094ab0bb165fd3efa7a --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:24:34,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:24:34,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:24:34,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:24:34,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:24:34,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:24:34,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:24:34,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:24:34,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:24:34,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:24:34,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:24:34,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:24:34,134 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:24:34,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:24:34,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:24:34,134 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:24:34,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:24:34,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:24:34,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:24:34,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:24:34,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:24:34,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:24:34,135 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:24:34,135 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:24:34,135 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:24:34,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:24:34,135 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:24:34,135 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:24:34,135 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:24:34,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:24:34,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:24:34,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:24:34,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:24:34,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:24:34,136 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:24:34,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:24:34,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:24:34,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:24:34,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:24:34,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:24:34,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:24:34,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:24:34,137 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 -> a107795e01eed1ee79fba30cb5022ee32b5d5a3711e8a094ab0bb165fd3efa7a [2025-03-13 22:24:34,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:24:34,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:24:34,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:24:34,360 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:24:34,360 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:24:34,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c [2025-03-13 22:24:35,538 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d88552b74/c572888a08d4429b945dec04a20de471/FLAGcde3fc4b3 [2025-03-13 22:24:35,778 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:24:35,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c [2025-03-13 22:24:35,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d88552b74/c572888a08d4429b945dec04a20de471/FLAGcde3fc4b3 [2025-03-13 22:24:36,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d88552b74/c572888a08d4429b945dec04a20de471 [2025-03-13 22:24:36,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:24:36,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:24:36,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:24:36,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:24:36,121 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:24:36,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:24:36" (1/1) ... [2025-03-13 22:24:36,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a274b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:36, skipping insertion in model container [2025-03-13 22:24:36,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:24:36" (1/1) ... [2025-03-13 22:24:36,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:24:36,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:24:36,252 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:24:36,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:24:36,298 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:24:36,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:36 WrapperNode [2025-03-13 22:24:36,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:24:36,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:24:36,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:24:36,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:24:36,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:36" (1/1) ... [2025-03-13 22:24:36,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:36" (1/1) ... [2025-03-13 22:24:36,326 INFO L138 Inliner]: procedures = 22, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 305 [2025-03-13 22:24:36,326 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:24:36,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:24:36,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:24:36,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:24:36,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:36" (1/1) ... [2025-03-13 22:24:36,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:36" (1/1) ... [2025-03-13 22:24:36,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:36" (1/1) ... [2025-03-13 22:24:36,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:36" (1/1) ... [2025-03-13 22:24:36,344 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:36" (1/1) ... [2025-03-13 22:24:36,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:36" (1/1) ... [2025-03-13 22:24:36,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:36" (1/1) ... [2025-03-13 22:24:36,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:36" (1/1) ... [2025-03-13 22:24:36,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:24:36,349 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:24:36,349 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:24:36,349 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:24:36,350 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:36" (1/1) ... [2025-03-13 22:24:36,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:24:36,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:24:36,384 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:24:36,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:24:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:24:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:24:36,406 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:24:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:24:36,406 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:24:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 22:24:36,406 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 22:24:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-13 22:24:36,406 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-13 22:24:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:24:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-03-13 22:24:36,406 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-03-13 22:24:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-03-13 22:24:36,406 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-03-13 22:24:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:24:36,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:24:36,407 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:24:36,500 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:24:36,502 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:24:36,801 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:24:36,804 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:24:36,804 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:24:36,839 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:24:36,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:24:36 BoogieIcfgContainer [2025-03-13 22:24:36,839 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:24:36,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:24:36,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:24:36,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:24:36,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:24:36" (1/3) ... [2025-03-13 22:24:36,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301fbce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:24:36, skipping insertion in model container [2025-03-13 22:24:36,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:36" (2/3) ... [2025-03-13 22:24:36,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301fbce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:24:36, skipping insertion in model container [2025-03-13 22:24:36,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:24:36" (3/3) ... [2025-03-13 22:24:36,850 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-barrier-loop.wvr.c [2025-03-13 22:24:36,861 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:24:36,863 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-barrier-loop.wvr.c that has 7 procedures, 379 locations, 1 initial locations, 4 loop locations, and 24 error locations. [2025-03-13 22:24:36,863 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:24:36,976 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-03-13 22:24:37,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 405 places, 408 transitions, 882 flow [2025-03-13 22:24:37,139 INFO L124 PetriNetUnfolderBase]: 22/394 cut-off events. [2025-03-13 22:24:37,141 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:24:37,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 394 events. 22/394 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 928 event pairs, 0 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 335. Up to 3 conditions per place. [2025-03-13 22:24:37,147 INFO L82 GeneralOperation]: Start removeDead. Operand has 405 places, 408 transitions, 882 flow [2025-03-13 22:24:37,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 375 places, 377 transitions, 799 flow [2025-03-13 22:24:37,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:24:37,178 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@8d6d710, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:24:37,178 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-13 22:24:37,188 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:24:37,188 INFO L124 PetriNetUnfolderBase]: 0/43 cut-off events. [2025-03-13 22:24:37,188 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:24:37,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:37,189 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] [2025-03-13 22:24:37,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:24:37,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:37,195 INFO L85 PathProgramCache]: Analyzing trace with hash -118034461, now seen corresponding path program 1 times [2025-03-13 22:24:37,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:37,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204947320] [2025-03-13 22:24:37,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:37,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:37,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-13 22:24:37,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-13 22:24:37,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:37,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:37,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:37,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204947320] [2025-03-13 22:24:37,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204947320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:37,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:37,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:37,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004223364] [2025-03-13 22:24:37,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:37,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:37,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:37,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:37,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:37,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 412 [2025-03-13 22:24:37,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 377 transitions, 799 flow. Second operand has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:37,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:37,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 412 [2025-03-13 22:24:37,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:42,507 INFO L124 PetriNetUnfolderBase]: 7436/38733 cut-off events. [2025-03-13 22:24:42,507 INFO L125 PetriNetUnfolderBase]: For 4083/4083 co-relation queries the response was YES. [2025-03-13 22:24:42,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51805 conditions, 38733 events. 7436/38733 cut-off events. For 4083/4083 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 530192 event pairs, 4596 based on Foata normal form. 3874/35820 useless extension candidates. Maximal degree in co-relation 50913. Up to 9448 conditions per place. [2025-03-13 22:24:42,920 INFO L140 encePairwiseOnDemand]: 396/412 looper letters, 48 selfloop transitions, 2 changer transitions 1/363 dead transitions. [2025-03-13 22:24:42,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 363 transitions, 871 flow [2025-03-13 22:24:42,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:42,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:42,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1072 transitions. [2025-03-13 22:24:42,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8673139158576052 [2025-03-13 22:24:42,938 INFO L175 Difference]: Start difference. First operand has 375 places, 377 transitions, 799 flow. Second operand 3 states and 1072 transitions. [2025-03-13 22:24:42,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 363 transitions, 871 flow [2025-03-13 22:24:42,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 363 transitions, 842 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-03-13 22:24:43,003 INFO L231 Difference]: Finished difference. Result has 365 places, 362 transitions, 744 flow [2025-03-13 22:24:43,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=365, PETRI_TRANSITIONS=362} [2025-03-13 22:24:43,009 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -10 predicate places. [2025-03-13 22:24:43,009 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 362 transitions, 744 flow [2025-03-13 22:24:43,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:43,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:43,011 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] [2025-03-13 22:24:43,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:24:43,012 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:24:43,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:43,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1907302591, now seen corresponding path program 1 times [2025-03-13 22:24:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:43,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484558052] [2025-03-13 22:24:43,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:43,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:43,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:24:43,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:24:43,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:43,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:43,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:43,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:43,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484558052] [2025-03-13 22:24:43,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484558052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:43,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:43,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:43,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360073525] [2025-03-13 22:24:43,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:43,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:43,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:43,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:43,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:43,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 412 [2025-03-13 22:24:43,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 362 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:43,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:43,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 412 [2025-03-13 22:24:43,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:47,044 INFO L124 PetriNetUnfolderBase]: 7436/39583 cut-off events. [2025-03-13 22:24:47,044 INFO L125 PetriNetUnfolderBase]: For 1130/1130 co-relation queries the response was YES. [2025-03-13 22:24:47,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49802 conditions, 39583 events. 7436/39583 cut-off events. For 1130/1130 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 547817 event pairs, 4596 based on Foata normal form. 0/32470 useless extension candidates. Maximal degree in co-relation 49747. Up to 9478 conditions per place. [2025-03-13 22:24:47,325 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 48 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2025-03-13 22:24:47,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 361 transitions, 842 flow [2025-03-13 22:24:47,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:47,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1059 transitions. [2025-03-13 22:24:47,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8567961165048543 [2025-03-13 22:24:47,331 INFO L175 Difference]: Start difference. First operand has 365 places, 362 transitions, 744 flow. Second operand 3 states and 1059 transitions. [2025-03-13 22:24:47,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 361 transitions, 842 flow [2025-03-13 22:24:47,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 361 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:47,338 INFO L231 Difference]: Finished difference. Result has 363 places, 361 transitions, 742 flow [2025-03-13 22:24:47,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=742, PETRI_PLACES=363, PETRI_TRANSITIONS=361} [2025-03-13 22:24:47,339 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -12 predicate places. [2025-03-13 22:24:47,339 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 361 transitions, 742 flow [2025-03-13 22:24:47,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:47,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:47,340 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-03-13 22:24:47,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:24:47,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:24:47,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:47,341 INFO L85 PathProgramCache]: Analyzing trace with hash -297753351, now seen corresponding path program 1 times [2025-03-13 22:24:47,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:47,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942919008] [2025-03-13 22:24:47,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:47,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:47,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-13 22:24:47,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-13 22:24:47,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:47,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:47,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:47,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942919008] [2025-03-13 22:24:47,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942919008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:47,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:47,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:47,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790076933] [2025-03-13 22:24:47,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:47,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:47,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:47,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:47,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:47,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 412 [2025-03-13 22:24:47,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 361 transitions, 742 flow. Second operand has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:47,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:47,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 412 [2025-03-13 22:24:47,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:51,589 INFO L124 PetriNetUnfolderBase]: 7676/38745 cut-off events. [2025-03-13 22:24:51,590 INFO L125 PetriNetUnfolderBase]: For 1288/1288 co-relation queries the response was YES. [2025-03-13 22:24:51,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49114 conditions, 38745 events. 7676/38745 cut-off events. For 1288/1288 co-relation queries the response was YES. Maximal size of possible extension queue 794. Compared 528979 event pairs, 4596 based on Foata normal form. 0/31819 useless extension candidates. Maximal degree in co-relation 49052. Up to 9708 conditions per place. [2025-03-13 22:24:51,838 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 48 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2025-03-13 22:24:51,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 360 transitions, 840 flow [2025-03-13 22:24:51,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1059 transitions. [2025-03-13 22:24:51,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8567961165048543 [2025-03-13 22:24:51,840 INFO L175 Difference]: Start difference. First operand has 363 places, 361 transitions, 742 flow. Second operand 3 states and 1059 transitions. [2025-03-13 22:24:51,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 360 transitions, 840 flow [2025-03-13 22:24:51,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 360 transitions, 836 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:51,844 INFO L231 Difference]: Finished difference. Result has 362 places, 360 transitions, 740 flow [2025-03-13 22:24:51,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=362, PETRI_TRANSITIONS=360} [2025-03-13 22:24:51,845 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -13 predicate places. [2025-03-13 22:24:51,845 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 360 transitions, 740 flow [2025-03-13 22:24:51,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:51,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:51,846 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] [2025-03-13 22:24:51,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:24:51,846 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:24:51,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:51,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1596382869, now seen corresponding path program 1 times [2025-03-13 22:24:51,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:51,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564877301] [2025-03-13 22:24:51,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:51,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:51,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-13 22:24:51,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-13 22:24:51,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:51,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:51,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:51,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564877301] [2025-03-13 22:24:51,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564877301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:51,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:51,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:51,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893977167] [2025-03-13 22:24:51,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:51,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:51,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:51,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:51,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:51,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 412 [2025-03-13 22:24:51,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 360 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:51,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:51,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 412 [2025-03-13 22:24:51,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:55,981 INFO L124 PetriNetUnfolderBase]: 7676/39347 cut-off events. [2025-03-13 22:24:55,981 INFO L125 PetriNetUnfolderBase]: For 1290/1290 co-relation queries the response was YES. [2025-03-13 22:24:56,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49726 conditions, 39347 events. 7676/39347 cut-off events. For 1290/1290 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 540500 event pairs, 4596 based on Foata normal form. 0/32097 useless extension candidates. Maximal degree in co-relation 49657. Up to 9718 conditions per place. [2025-03-13 22:24:56,266 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 48 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2025-03-13 22:24:56,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 359 transitions, 838 flow [2025-03-13 22:24:56,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1059 transitions. [2025-03-13 22:24:56,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8567961165048543 [2025-03-13 22:24:56,270 INFO L175 Difference]: Start difference. First operand has 362 places, 360 transitions, 740 flow. Second operand 3 states and 1059 transitions. [2025-03-13 22:24:56,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 359 transitions, 838 flow [2025-03-13 22:24:56,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 359 transitions, 834 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:56,274 INFO L231 Difference]: Finished difference. Result has 361 places, 359 transitions, 738 flow [2025-03-13 22:24:56,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=361, PETRI_TRANSITIONS=359} [2025-03-13 22:24:56,276 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -14 predicate places. [2025-03-13 22:24:56,276 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 359 transitions, 738 flow [2025-03-13 22:24:56,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:56,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:56,277 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] [2025-03-13 22:24:56,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:24:56,277 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:24:56,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:56,279 INFO L85 PathProgramCache]: Analyzing trace with hash 323886849, now seen corresponding path program 1 times [2025-03-13 22:24:56,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:56,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47365652] [2025-03-13 22:24:56,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:56,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:56,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-13 22:24:56,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-13 22:24:56,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:56,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:56,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:56,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47365652] [2025-03-13 22:24:56,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47365652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:56,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:56,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:56,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769898961] [2025-03-13 22:24:56,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:56,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:56,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:56,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:56,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:56,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 412 [2025-03-13 22:24:56,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 359 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:56,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:56,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 412 [2025-03-13 22:24:56,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:00,286 INFO L124 PetriNetUnfolderBase]: 7436/38358 cut-off events. [2025-03-13 22:25:00,287 INFO L125 PetriNetUnfolderBase]: For 1142/1142 co-relation queries the response was YES. [2025-03-13 22:25:00,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48525 conditions, 38358 events. 7436/38358 cut-off events. For 1142/1142 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 524883 event pairs, 4596 based on Foata normal form. 0/31675 useless extension candidates. Maximal degree in co-relation 48449. Up to 9450 conditions per place. [2025-03-13 22:25:00,600 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 48 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2025-03-13 22:25:00,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 358 transitions, 836 flow [2025-03-13 22:25:00,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1059 transitions. [2025-03-13 22:25:00,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8567961165048543 [2025-03-13 22:25:00,603 INFO L175 Difference]: Start difference. First operand has 361 places, 359 transitions, 738 flow. Second operand 3 states and 1059 transitions. [2025-03-13 22:25:00,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 358 transitions, 836 flow [2025-03-13 22:25:00,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 358 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:00,607 INFO L231 Difference]: Finished difference. Result has 360 places, 358 transitions, 736 flow [2025-03-13 22:25:00,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=360, PETRI_TRANSITIONS=358} [2025-03-13 22:25:00,608 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -15 predicate places. [2025-03-13 22:25:00,608 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 358 transitions, 736 flow [2025-03-13 22:25:00,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:00,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:00,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:00,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:25:00,609 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:25:00,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:00,610 INFO L85 PathProgramCache]: Analyzing trace with hash 420709178, now seen corresponding path program 1 times [2025-03-13 22:25:00,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:00,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963156395] [2025-03-13 22:25:00,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:00,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:00,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-13 22:25:00,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-13 22:25:00,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:00,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:00,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:00,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:00,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963156395] [2025-03-13 22:25:00,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963156395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:00,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:00,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:00,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039783495] [2025-03-13 22:25:00,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:00,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:00,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:00,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:00,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:00,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 412 [2025-03-13 22:25:00,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 358 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:00,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:00,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 412 [2025-03-13 22:25:00,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:04,751 INFO L124 PetriNetUnfolderBase]: 7436/38709 cut-off events. [2025-03-13 22:25:04,752 INFO L125 PetriNetUnfolderBase]: For 1142/1142 co-relation queries the response was YES. [2025-03-13 22:25:04,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48904 conditions, 38709 events. 7436/38709 cut-off events. For 1142/1142 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 532292 event pairs, 4596 based on Foata normal form. 0/31649 useless extension candidates. Maximal degree in co-relation 48821. Up to 9478 conditions per place. [2025-03-13 22:25:05,050 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 48 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-03-13 22:25:05,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 357 transitions, 834 flow [2025-03-13 22:25:05,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1059 transitions. [2025-03-13 22:25:05,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8567961165048543 [2025-03-13 22:25:05,053 INFO L175 Difference]: Start difference. First operand has 360 places, 358 transitions, 736 flow. Second operand 3 states and 1059 transitions. [2025-03-13 22:25:05,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 357 transitions, 834 flow [2025-03-13 22:25:05,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 357 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:05,057 INFO L231 Difference]: Finished difference. Result has 359 places, 357 transitions, 734 flow [2025-03-13 22:25:05,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=359, PETRI_TRANSITIONS=357} [2025-03-13 22:25:05,058 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -16 predicate places. [2025-03-13 22:25:05,058 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 357 transitions, 734 flow [2025-03-13 22:25:05,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:05,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:05,059 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-03-13 22:25:05,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:25:05,059 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:25:05,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:05,060 INFO L85 PathProgramCache]: Analyzing trace with hash 574321130, now seen corresponding path program 1 times [2025-03-13 22:25:05,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:05,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921131318] [2025-03-13 22:25:05,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:05,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:05,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-13 22:25:05,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-13 22:25:05,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:05,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:05,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:05,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921131318] [2025-03-13 22:25:05,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921131318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:05,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:05,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:05,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056918264] [2025-03-13 22:25:05,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:05,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:05,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:05,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:05,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:05,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 412 [2025-03-13 22:25:05,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 357 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:05,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:05,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 412 [2025-03-13 22:25:05,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:09,053 INFO L124 PetriNetUnfolderBase]: 7676/38233 cut-off events. [2025-03-13 22:25:09,053 INFO L125 PetriNetUnfolderBase]: For 1302/1302 co-relation queries the response was YES. [2025-03-13 22:25:09,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48586 conditions, 38233 events. 7676/38233 cut-off events. For 1302/1302 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 522570 event pairs, 4596 based on Foata normal form. 0/31435 useless extension candidates. Maximal degree in co-relation 48496. Up to 9716 conditions per place. [2025-03-13 22:25:09,359 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 48 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2025-03-13 22:25:09,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 356 transitions, 832 flow [2025-03-13 22:25:09,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1059 transitions. [2025-03-13 22:25:09,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8567961165048543 [2025-03-13 22:25:09,362 INFO L175 Difference]: Start difference. First operand has 359 places, 357 transitions, 734 flow. Second operand 3 states and 1059 transitions. [2025-03-13 22:25:09,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 356 transitions, 832 flow [2025-03-13 22:25:09,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 356 transitions, 828 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:09,366 INFO L231 Difference]: Finished difference. Result has 358 places, 356 transitions, 732 flow [2025-03-13 22:25:09,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=358, PETRI_TRANSITIONS=356} [2025-03-13 22:25:09,367 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -17 predicate places. [2025-03-13 22:25:09,367 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 356 transitions, 732 flow [2025-03-13 22:25:09,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:09,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:09,367 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] [2025-03-13 22:25:09,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:25:09,368 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:25:09,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:09,368 INFO L85 PathProgramCache]: Analyzing trace with hash 536843633, now seen corresponding path program 1 times [2025-03-13 22:25:09,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:09,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553455440] [2025-03-13 22:25:09,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:09,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:09,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-13 22:25:09,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-13 22:25:09,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:09,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:09,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:09,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:09,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553455440] [2025-03-13 22:25:09,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553455440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:09,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:09,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:09,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605537895] [2025-03-13 22:25:09,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:09,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:09,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:09,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:09,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:09,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 412 [2025-03-13 22:25:09,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 356 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:09,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:09,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 412 [2025-03-13 22:25:09,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:13,534 INFO L124 PetriNetUnfolderBase]: 7676/37903 cut-off events. [2025-03-13 22:25:13,535 INFO L125 PetriNetUnfolderBase]: For 1302/1302 co-relation queries the response was YES. [2025-03-13 22:25:13,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48258 conditions, 37903 events. 7676/37903 cut-off events. For 1302/1302 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 513119 event pairs, 4596 based on Foata normal form. 0/30822 useless extension candidates. Maximal degree in co-relation 48161. Up to 9718 conditions per place. [2025-03-13 22:25:13,855 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 48 selfloop transitions, 2 changer transitions 0/355 dead transitions. [2025-03-13 22:25:13,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 355 transitions, 830 flow [2025-03-13 22:25:13,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:13,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1059 transitions. [2025-03-13 22:25:13,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8567961165048543 [2025-03-13 22:25:13,857 INFO L175 Difference]: Start difference. First operand has 358 places, 356 transitions, 732 flow. Second operand 3 states and 1059 transitions. [2025-03-13 22:25:13,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 355 transitions, 830 flow [2025-03-13 22:25:13,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 355 transitions, 826 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:13,860 INFO L231 Difference]: Finished difference. Result has 357 places, 355 transitions, 730 flow [2025-03-13 22:25:13,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=357, PETRI_TRANSITIONS=355} [2025-03-13 22:25:13,862 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -18 predicate places. [2025-03-13 22:25:13,862 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 355 transitions, 730 flow [2025-03-13 22:25:13,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:13,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:13,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:13,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:25:13,863 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:25:13,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:13,863 INFO L85 PathProgramCache]: Analyzing trace with hash -629188407, now seen corresponding path program 1 times [2025-03-13 22:25:13,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:13,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461346649] [2025-03-13 22:25:13,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:13,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:13,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-13 22:25:13,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-13 22:25:13,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:13,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:13,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-03-13 22:25:13,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:13,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461346649] [2025-03-13 22:25:13,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461346649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:13,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:13,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:13,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571806245] [2025-03-13 22:25:13,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:13,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:13,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:13,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:13,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:13,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 412 [2025-03-13 22:25:13,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 355 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 343.3333333333333) internal successors, (1030), 3 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:13,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:13,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 412 [2025-03-13 22:25:13,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:18,834 INFO L124 PetriNetUnfolderBase]: 9800/44779 cut-off events. [2025-03-13 22:25:18,835 INFO L125 PetriNetUnfolderBase]: For 1346/1346 co-relation queries the response was YES. [2025-03-13 22:25:19,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58333 conditions, 44779 events. 9800/44779 cut-off events. For 1346/1346 co-relation queries the response was YES. Maximal size of possible extension queue 928. Compared 615088 event pairs, 5174 based on Foata normal form. 0/36839 useless extension candidates. Maximal degree in co-relation 58229. Up to 10505 conditions per place. [2025-03-13 22:25:19,231 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 69 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2025-03-13 22:25:19,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 376 transitions, 923 flow [2025-03-13 22:25:19,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:19,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1086 transitions. [2025-03-13 22:25:19,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8786407766990292 [2025-03-13 22:25:19,408 INFO L175 Difference]: Start difference. First operand has 357 places, 355 transitions, 730 flow. Second operand 3 states and 1086 transitions. [2025-03-13 22:25:19,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 376 transitions, 923 flow [2025-03-13 22:25:19,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 376 transitions, 919 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:19,414 INFO L231 Difference]: Finished difference. Result has 356 places, 354 transitions, 728 flow [2025-03-13 22:25:19,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=728, PETRI_PLACES=356, PETRI_TRANSITIONS=354} [2025-03-13 22:25:19,416 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2025-03-13 22:25:19,416 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 354 transitions, 728 flow [2025-03-13 22:25:19,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 343.3333333333333) internal successors, (1030), 3 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:19,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:19,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:19,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:25:19,417 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:25:19,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:19,417 INFO L85 PathProgramCache]: Analyzing trace with hash -913716061, now seen corresponding path program 1 times [2025-03-13 22:25:19,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:19,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346066] [2025-03-13 22:25:19,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:19,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:19,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-13 22:25:19,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-13 22:25:19,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:19,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:19,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:19,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346066] [2025-03-13 22:25:19,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:19,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:19,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:19,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566949011] [2025-03-13 22:25:19,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:19,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:19,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:19,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:19,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:19,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 412 [2025-03-13 22:25:19,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 354 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 345.3333333333333) internal successors, (1036), 3 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:19,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:19,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 412 [2025-03-13 22:25:19,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand