./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 729ea5b7f047316231f562bf88a66f84bb913811f2b458cb706ab3ed78d2b3a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:43:34,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:43:34,235 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:43:34,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:43:34,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:43:34,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:43:34,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:43:34,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:43:34,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:43:34,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:43:34,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:43:34,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:43:34,276 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:43:34,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:43:34,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:43:34,276 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:43:34,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:43:34,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:43:34,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:43:34,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:43:34,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:43:34,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:43:34,277 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:43:34,277 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:43:34,277 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:43:34,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:43:34,277 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:43:34,278 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:43:34,278 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:43:34,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:43:34,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:43:34,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:43:34,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:43:34,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:43:34,278 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:43:34,278 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:43:34,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:43:34,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:43:34,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:43:34,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:43:34,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:43:34,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:43:34,279 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 729ea5b7f047316231f562bf88a66f84bb913811f2b458cb706ab3ed78d2b3a0 [2025-02-08 05:43:34,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:43:34,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:43:34,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:43:34,585 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:43:34,585 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:43:34,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race-2.i [2025-02-08 05:43:35,890 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7c1ab88a/4f8c9a40c5514ed79ba802e1cc958dd0/FLAG3d169a29b [2025-02-08 05:43:36,225 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:43:36,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race-2.i [2025-02-08 05:43:36,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7c1ab88a/4f8c9a40c5514ed79ba802e1cc958dd0/FLAG3d169a29b [2025-02-08 05:43:36,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7c1ab88a/4f8c9a40c5514ed79ba802e1cc958dd0 [2025-02-08 05:43:36,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:43:36,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:43:36,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:43:36,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:43:36,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:43:36,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:43:36" (1/1) ... [2025-02-08 05:43:36,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a35125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:36, skipping insertion in model container [2025-02-08 05:43:36,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:43:36" (1/1) ... [2025-02-08 05:43:36,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:43:36,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:43:36,974 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:43:37,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:43:37,088 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:43:37,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:37 WrapperNode [2025-02-08 05:43:37,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:43:37,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:43:37,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:43:37,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:43:37,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:37" (1/1) ... [2025-02-08 05:43:37,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:37" (1/1) ... [2025-02-08 05:43:37,128 INFO L138 Inliner]: procedures = 277, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2025-02-08 05:43:37,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:43:37,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:43:37,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:43:37,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:43:37,136 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:37" (1/1) ... [2025-02-08 05:43:37,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:37" (1/1) ... [2025-02-08 05:43:37,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:37" (1/1) ... [2025-02-08 05:43:37,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:37" (1/1) ... [2025-02-08 05:43:37,157 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:37" (1/1) ... [2025-02-08 05:43:37,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:37" (1/1) ... [2025-02-08 05:43:37,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:37" (1/1) ... [2025-02-08 05:43:37,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:37" (1/1) ... [2025-02-08 05:43:37,165 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:43:37,165 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:43:37,165 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:43:37,165 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:43:37,166 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:37" (1/1) ... [2025-02-08 05:43:37,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:43:37,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:43:37,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:43:37,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:43:37,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:43:37,220 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:43:37,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:43:37,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:43:37,220 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:43:37,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:43:37,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:43:37,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:43:37,221 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-02-08 05:43:37,221 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-02-08 05:43:37,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:43:37,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:43:37,222 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:43:37,337 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:43:37,339 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:43:37,632 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:43:37,632 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:43:37,655 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:43:37,656 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:43:37,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:43:37 BoogieIcfgContainer [2025-02-08 05:43:37,656 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:43:37,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:43:37,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:43:37,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:43:37,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:43:36" (1/3) ... [2025-02-08 05:43:37,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eda785a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:43:37, skipping insertion in model container [2025-02-08 05:43:37,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:37" (2/3) ... [2025-02-08 05:43:37,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eda785a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:43:37, skipping insertion in model container [2025-02-08 05:43:37,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:43:37" (3/3) ... [2025-02-08 05:43:37,664 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-index-inc-race-2.i [2025-02-08 05:43:37,676 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:43:37,678 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-index-inc-race-2.i that has 2 procedures, 119 locations, 1 initial locations, 2 loop locations, and 9 error locations. [2025-02-08 05:43:37,678 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:43:37,774 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:43:37,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 121 transitions, 249 flow [2025-02-08 05:43:37,880 INFO L124 PetriNetUnfolderBase]: 2/154 cut-off events. [2025-02-08 05:43:37,884 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:43:37,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 154 events. 2/154 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 246 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 70. Up to 3 conditions per place. [2025-02-08 05:43:37,888 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 121 transitions, 249 flow [2025-02-08 05:43:37,893 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 121 transitions, 249 flow [2025-02-08 05:43:37,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:43:37,916 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;@d6cf543, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:43:37,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-02-08 05:43:37,933 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:43:37,933 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2025-02-08 05:43:37,933 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:43:37,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:37,934 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:37,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:43:37,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:37,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1950568123, now seen corresponding path program 1 times [2025-02-08 05:43:37,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:37,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967103048] [2025-02-08 05:43:37,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:37,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:38,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:43:38,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:43:38,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:38,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:38,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:38,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:38,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967103048] [2025-02-08 05:43:38,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967103048] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:38,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:38,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:38,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896397280] [2025-02-08 05:43:38,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:38,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:38,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:38,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:38,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:38,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 121 [2025-02-08 05:43:38,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 121 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:38,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:38,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 121 [2025-02-08 05:43:38,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:38,357 INFO L124 PetriNetUnfolderBase]: 7/230 cut-off events. [2025-02-08 05:43:38,358 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:43:38,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 230 events. 7/230 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 590 event pairs, 6 based on Foata normal form. 1/203 useless extension candidates. Maximal degree in co-relation 172. Up to 25 conditions per place. [2025-02-08 05:43:38,363 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 10 selfloop transitions, 2 changer transitions 1/119 dead transitions. [2025-02-08 05:43:38,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 119 transitions, 269 flow [2025-02-08 05:43:38,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:38,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:38,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2025-02-08 05:43:38,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9228650137741047 [2025-02-08 05:43:38,379 INFO L175 Difference]: Start difference. First operand has 122 places, 121 transitions, 249 flow. Second operand 3 states and 335 transitions. [2025-02-08 05:43:38,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 119 transitions, 269 flow [2025-02-08 05:43:38,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 119 transitions, 269 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:38,387 INFO L231 Difference]: Finished difference. Result has 123 places, 118 transitions, 247 flow [2025-02-08 05:43:38,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=123, PETRI_TRANSITIONS=118} [2025-02-08 05:43:38,396 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 1 predicate places. [2025-02-08 05:43:38,398 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 118 transitions, 247 flow [2025-02-08 05:43:38,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:38,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:38,400 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] [2025-02-08 05:43:38,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:43:38,400 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:43:38,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:38,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1888863802, now seen corresponding path program 1 times [2025-02-08 05:43:38,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:38,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68433210] [2025-02-08 05:43:38,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:38,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:38,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:43:38,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:43:38,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:38,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:38,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:38,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:38,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68433210] [2025-02-08 05:43:38,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68433210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:38,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:38,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:38,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252015005] [2025-02-08 05:43:38,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:38,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:38,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:38,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:38,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:38,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 121 [2025-02-08 05:43:38,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 118 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:38,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:38,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 121 [2025-02-08 05:43:38,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:38,618 INFO L124 PetriNetUnfolderBase]: 9/220 cut-off events. [2025-02-08 05:43:38,619 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:43:38,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 220 events. 9/220 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 510 event pairs, 3 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 217. Up to 24 conditions per place. [2025-02-08 05:43:38,621 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 11 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2025-02-08 05:43:38,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 120 transitions, 277 flow [2025-02-08 05:43:38,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2025-02-08 05:43:38,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9421487603305785 [2025-02-08 05:43:38,626 INFO L175 Difference]: Start difference. First operand has 123 places, 118 transitions, 247 flow. Second operand 3 states and 342 transitions. [2025-02-08 05:43:38,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 120 transitions, 277 flow [2025-02-08 05:43:38,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 120 transitions, 273 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:43:38,632 INFO L231 Difference]: Finished difference. Result has 121 places, 118 transitions, 253 flow [2025-02-08 05:43:38,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=121, PETRI_TRANSITIONS=118} [2025-02-08 05:43:38,634 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -1 predicate places. [2025-02-08 05:43:38,634 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 118 transitions, 253 flow [2025-02-08 05:43:38,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:38,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:38,635 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] [2025-02-08 05:43:38,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:43:38,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:43:38,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:38,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1657724845, now seen corresponding path program 1 times [2025-02-08 05:43:38,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:38,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166063204] [2025-02-08 05:43:38,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:38,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:38,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:43:38,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:43:38,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:38,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:39,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:39,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166063204] [2025-02-08 05:43:39,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166063204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:39,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:39,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:39,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287974054] [2025-02-08 05:43:39,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:39,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:43:39,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:39,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:43:39,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:43:39,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 121 [2025-02-08 05:43:39,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 118 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:39,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:39,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 121 [2025-02-08 05:43:39,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:39,726 INFO L124 PetriNetUnfolderBase]: 100/685 cut-off events. [2025-02-08 05:43:39,726 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:43:39,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 685 events. 100/685 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3741 event pairs, 52 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 850. Up to 195 conditions per place. [2025-02-08 05:43:39,733 INFO L140 encePairwiseOnDemand]: 110/121 looper letters, 33 selfloop transitions, 22 changer transitions 0/147 dead transitions. [2025-02-08 05:43:39,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 147 transitions, 421 flow [2025-02-08 05:43:39,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 620 transitions. [2025-02-08 05:43:39,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8539944903581267 [2025-02-08 05:43:39,737 INFO L175 Difference]: Start difference. First operand has 121 places, 118 transitions, 253 flow. Second operand 6 states and 620 transitions. [2025-02-08 05:43:39,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 147 transitions, 421 flow [2025-02-08 05:43:39,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 147 transitions, 421 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:39,743 INFO L231 Difference]: Finished difference. Result has 131 places, 139 transitions, 403 flow [2025-02-08 05:43:39,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=403, PETRI_PLACES=131, PETRI_TRANSITIONS=139} [2025-02-08 05:43:39,744 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 9 predicate places. [2025-02-08 05:43:39,744 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 139 transitions, 403 flow [2025-02-08 05:43:39,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:39,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:39,745 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] [2025-02-08 05:43:39,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:43:39,745 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:43:39,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:39,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1573759414, now seen corresponding path program 1 times [2025-02-08 05:43:39,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:39,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808375701] [2025-02-08 05:43:39,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:39,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:39,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:43:39,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:43:39,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:39,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:39,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:39,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:39,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808375701] [2025-02-08 05:43:39,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808375701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:39,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:39,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:39,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330995645] [2025-02-08 05:43:39,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:39,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:43:39,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:39,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:43:39,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:43:39,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 121 [2025-02-08 05:43:39,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 139 transitions, 403 flow. Second operand has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:39,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:39,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 121 [2025-02-08 05:43:39,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:40,040 INFO L124 PetriNetUnfolderBase]: 48/376 cut-off events. [2025-02-08 05:43:40,041 INFO L125 PetriNetUnfolderBase]: For 38/48 co-relation queries the response was YES. [2025-02-08 05:43:40,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 376 events. 48/376 cut-off events. For 38/48 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1478 event pairs, 6 based on Foata normal form. 1/354 useless extension candidates. Maximal degree in co-relation 489. Up to 53 conditions per place. [2025-02-08 05:43:40,043 INFO L140 encePairwiseOnDemand]: 113/121 looper letters, 15 selfloop transitions, 2 changer transitions 5/146 dead transitions. [2025-02-08 05:43:40,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 146 transitions, 461 flow [2025-02-08 05:43:40,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:40,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 653 transitions. [2025-02-08 05:43:40,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8994490358126722 [2025-02-08 05:43:40,046 INFO L175 Difference]: Start difference. First operand has 131 places, 139 transitions, 403 flow. Second operand 6 states and 653 transitions. [2025-02-08 05:43:40,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 146 transitions, 461 flow [2025-02-08 05:43:40,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 146 transitions, 461 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:40,052 INFO L231 Difference]: Finished difference. Result has 140 places, 139 transitions, 421 flow [2025-02-08 05:43:40,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=421, PETRI_PLACES=140, PETRI_TRANSITIONS=139} [2025-02-08 05:43:40,053 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 18 predicate places. [2025-02-08 05:43:40,053 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 139 transitions, 421 flow [2025-02-08 05:43:40,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:40,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:40,054 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] [2025-02-08 05:43:40,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:43:40,054 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:43:40,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:40,055 INFO L85 PathProgramCache]: Analyzing trace with hash -924592559, now seen corresponding path program 1 times [2025-02-08 05:43:40,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:40,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427986628] [2025-02-08 05:43:40,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:40,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:40,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 05:43:40,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 05:43:40,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:40,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:40,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:40,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427986628] [2025-02-08 05:43:40,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427986628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:40,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:40,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:40,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289580793] [2025-02-08 05:43:40,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:40,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:40,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:40,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:40,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:40,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 121 [2025-02-08 05:43:40,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 139 transitions, 421 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:40,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:40,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 121 [2025-02-08 05:43:40,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:40,180 INFO L124 PetriNetUnfolderBase]: 30/272 cut-off events. [2025-02-08 05:43:40,181 INFO L125 PetriNetUnfolderBase]: For 33/44 co-relation queries the response was YES. [2025-02-08 05:43:40,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 272 events. 30/272 cut-off events. For 33/44 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 864 event pairs, 0 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 372. Up to 49 conditions per place. [2025-02-08 05:43:40,183 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 7 selfloop transitions, 2 changer transitions 0/137 dead transitions. [2025-02-08 05:43:40,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 137 transitions, 435 flow [2025-02-08 05:43:40,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2025-02-08 05:43:40,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.931129476584022 [2025-02-08 05:43:40,187 INFO L175 Difference]: Start difference. First operand has 140 places, 139 transitions, 421 flow. Second operand 3 states and 338 transitions. [2025-02-08 05:43:40,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 137 transitions, 435 flow [2025-02-08 05:43:40,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 137 transitions, 421 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-02-08 05:43:40,196 INFO L231 Difference]: Finished difference. Result has 132 places, 137 transitions, 407 flow [2025-02-08 05:43:40,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=132, PETRI_TRANSITIONS=137} [2025-02-08 05:43:40,197 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 10 predicate places. [2025-02-08 05:43:40,197 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 137 transitions, 407 flow [2025-02-08 05:43:40,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:40,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:40,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:40,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:43:40,200 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:43:40,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:40,203 INFO L85 PathProgramCache]: Analyzing trace with hash -455025258, now seen corresponding path program 1 times [2025-02-08 05:43:40,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:40,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509055886] [2025-02-08 05:43:40,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:40,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:40,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 05:43:40,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 05:43:40,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:40,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:40,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:40,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:40,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509055886] [2025-02-08 05:43:40,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509055886] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:40,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:40,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:40,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947699346] [2025-02-08 05:43:40,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:40,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:40,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:40,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:40,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:40,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 121 [2025-02-08 05:43:40,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 137 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:40,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:40,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 121 [2025-02-08 05:43:40,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:40,331 INFO L124 PetriNetUnfolderBase]: 30/271 cut-off events. [2025-02-08 05:43:40,331 INFO L125 PetriNetUnfolderBase]: For 33/44 co-relation queries the response was YES. [2025-02-08 05:43:40,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 271 events. 30/271 cut-off events. For 33/44 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 863 event pairs, 0 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 361. Up to 49 conditions per place. [2025-02-08 05:43:40,336 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 8 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2025-02-08 05:43:40,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 136 transitions, 425 flow [2025-02-08 05:43:40,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:40,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2025-02-08 05:43:40,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.931129476584022 [2025-02-08 05:43:40,339 INFO L175 Difference]: Start difference. First operand has 132 places, 137 transitions, 407 flow. Second operand 3 states and 338 transitions. [2025-02-08 05:43:40,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 136 transitions, 425 flow [2025-02-08 05:43:40,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 136 transitions, 421 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:43:40,358 INFO L231 Difference]: Finished difference. Result has 131 places, 136 transitions, 405 flow [2025-02-08 05:43:40,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=131, PETRI_TRANSITIONS=136} [2025-02-08 05:43:40,359 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 9 predicate places. [2025-02-08 05:43:40,359 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 136 transitions, 405 flow [2025-02-08 05:43:40,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:40,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:40,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:40,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:43:40,360 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:43:40,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:40,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1668267709, now seen corresponding path program 1 times [2025-02-08 05:43:40,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:40,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138541911] [2025-02-08 05:43:40,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:40,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:40,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 05:43:40,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 05:43:40,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:40,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:40,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:40,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138541911] [2025-02-08 05:43:40,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138541911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:40,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:40,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:40,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711071836] [2025-02-08 05:43:40,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:40,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:43:40,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:40,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:43:40,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:43:40,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 121 [2025-02-08 05:43:40,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 136 transitions, 405 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:40,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:40,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 121 [2025-02-08 05:43:40,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:41,020 INFO L124 PetriNetUnfolderBase]: 104/614 cut-off events. [2025-02-08 05:43:41,021 INFO L125 PetriNetUnfolderBase]: For 107/109 co-relation queries the response was YES. [2025-02-08 05:43:41,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1136 conditions, 614 events. 104/614 cut-off events. For 107/109 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3218 event pairs, 26 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 1017. Up to 203 conditions per place. [2025-02-08 05:43:41,027 INFO L140 encePairwiseOnDemand]: 110/121 looper letters, 48 selfloop transitions, 21 changer transitions 7/166 dead transitions. [2025-02-08 05:43:41,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 166 transitions, 646 flow [2025-02-08 05:43:41,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:41,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:41,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 631 transitions. [2025-02-08 05:43:41,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8691460055096418 [2025-02-08 05:43:41,030 INFO L175 Difference]: Start difference. First operand has 131 places, 136 transitions, 405 flow. Second operand 6 states and 631 transitions. [2025-02-08 05:43:41,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 166 transitions, 646 flow [2025-02-08 05:43:41,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 166 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:43:41,037 INFO L231 Difference]: Finished difference. Result has 139 places, 151 transitions, 562 flow [2025-02-08 05:43:41,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=562, PETRI_PLACES=139, PETRI_TRANSITIONS=151} [2025-02-08 05:43:41,039 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 17 predicate places. [2025-02-08 05:43:41,040 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 151 transitions, 562 flow [2025-02-08 05:43:41,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:41,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:41,041 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:41,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:43:41,041 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:43:41,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:41,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1515347763, now seen corresponding path program 1 times [2025-02-08 05:43:41,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:41,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975501671] [2025-02-08 05:43:41,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:41,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:41,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 05:43:41,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 05:43:41,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:41,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:43:41,072 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:43:41,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 05:43:41,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 05:43:41,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:41,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:43:41,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:43:41,120 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:43:41,121 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-02-08 05:43:41,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-02-08 05:43:41,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-02-08 05:43:41,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-02-08 05:43:41,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-02-08 05:43:41,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-02-08 05:43:41,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2025-02-08 05:43:41,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-02-08 05:43:41,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-02-08 05:43:41,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-02-08 05:43:41,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-02-08 05:43:41,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-02-08 05:43:41,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-02-08 05:43:41,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-02-08 05:43:41,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-02-08 05:43:41,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:43:41,125 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:41,131 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:43:41,131 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:43:41,162 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:43:41,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 161 transitions, 338 flow [2025-02-08 05:43:41,206 INFO L124 PetriNetUnfolderBase]: 4/262 cut-off events. [2025-02-08 05:43:41,206 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-02-08 05:43:41,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 262 events. 4/262 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 623 event pairs, 0 based on Foata normal form. 0/231 useless extension candidates. Maximal degree in co-relation 156. Up to 6 conditions per place. [2025-02-08 05:43:41,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 161 transitions, 338 flow [2025-02-08 05:43:41,210 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 161 transitions, 338 flow [2025-02-08 05:43:41,211 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:43:41,211 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;@d6cf543, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:43:41,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-02-08 05:43:41,215 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:43:41,215 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2025-02-08 05:43:41,216 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:43:41,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:41,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:41,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:43:41,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:41,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1864763398, now seen corresponding path program 1 times [2025-02-08 05:43:41,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:41,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651389262] [2025-02-08 05:43:41,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:41,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:41,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:43:41,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:43:41,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:41,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:41,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:41,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651389262] [2025-02-08 05:43:41,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651389262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:41,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:41,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:41,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067379529] [2025-02-08 05:43:41,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:41,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:41,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:41,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:41,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:41,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 161 [2025-02-08 05:43:41,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 161 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:41,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:41,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 161 [2025-02-08 05:43:41,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:41,451 INFO L124 PetriNetUnfolderBase]: 81/1022 cut-off events. [2025-02-08 05:43:41,452 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-02-08 05:43:41,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 1022 events. 81/1022 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6422 event pairs, 78 based on Foata normal form. 1/888 useless extension candidates. Maximal degree in co-relation 874. Up to 162 conditions per place. [2025-02-08 05:43:41,464 INFO L140 encePairwiseOnDemand]: 157/161 looper letters, 15 selfloop transitions, 2 changer transitions 1/159 dead transitions. [2025-02-08 05:43:41,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 159 transitions, 368 flow [2025-02-08 05:43:41,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2025-02-08 05:43:41,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9213250517598344 [2025-02-08 05:43:41,466 INFO L175 Difference]: Start difference. First operand has 163 places, 161 transitions, 338 flow. Second operand 3 states and 445 transitions. [2025-02-08 05:43:41,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 159 transitions, 368 flow [2025-02-08 05:43:41,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 159 transitions, 368 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:41,471 INFO L231 Difference]: Finished difference. Result has 164 places, 158 transitions, 336 flow [2025-02-08 05:43:41,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=164, PETRI_TRANSITIONS=158} [2025-02-08 05:43:41,473 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 1 predicate places. [2025-02-08 05:43:41,473 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 158 transitions, 336 flow [2025-02-08 05:43:41,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:41,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:41,474 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] [2025-02-08 05:43:41,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:43:41,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:43:41,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash 912514266, now seen corresponding path program 1 times [2025-02-08 05:43:41,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:41,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079304728] [2025-02-08 05:43:41,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:41,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:41,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:43:41,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:43:41,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:41,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:41,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:41,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:41,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079304728] [2025-02-08 05:43:41,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079304728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:41,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:41,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:41,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317457444] [2025-02-08 05:43:41,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:41,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:41,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:41,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:41,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:41,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 161 [2025-02-08 05:43:41,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 158 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:41,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:41,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 161 [2025-02-08 05:43:41,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:41,713 INFO L124 PetriNetUnfolderBase]: 132/1100 cut-off events. [2025-02-08 05:43:41,713 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-02-08 05:43:41,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 1100 events. 132/1100 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6947 event pairs, 61 based on Foata normal form. 0/1013 useless extension candidates. Maximal degree in co-relation 1342. Up to 227 conditions per place. [2025-02-08 05:43:41,719 INFO L140 encePairwiseOnDemand]: 155/161 looper letters, 20 selfloop transitions, 3 changer transitions 0/163 dead transitions. [2025-02-08 05:43:41,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 163 transitions, 397 flow [2025-02-08 05:43:41,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:41,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2025-02-08 05:43:41,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9358178053830227 [2025-02-08 05:43:41,721 INFO L175 Difference]: Start difference. First operand has 164 places, 158 transitions, 336 flow. Second operand 3 states and 452 transitions. [2025-02-08 05:43:41,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 163 transitions, 397 flow [2025-02-08 05:43:41,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 163 transitions, 393 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:43:41,724 INFO L231 Difference]: Finished difference. Result has 161 places, 158 transitions, 347 flow [2025-02-08 05:43:41,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=161, PETRI_TRANSITIONS=158} [2025-02-08 05:43:41,725 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, -2 predicate places. [2025-02-08 05:43:41,725 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 158 transitions, 347 flow [2025-02-08 05:43:41,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:41,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:41,725 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] [2025-02-08 05:43:41,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:43:41,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:43:41,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:41,726 INFO L85 PathProgramCache]: Analyzing trace with hash 668214035, now seen corresponding path program 1 times [2025-02-08 05:43:41,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:41,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259860025] [2025-02-08 05:43:41,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:41,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:41,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:43:41,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:43:41,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:41,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:41,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:41,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259860025] [2025-02-08 05:43:41,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259860025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:41,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:41,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:41,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213719765] [2025-02-08 05:43:41,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:41,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:43:41,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:41,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:43:41,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:43:42,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 161 [2025-02-08 05:43:42,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 158 transitions, 347 flow. Second operand has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:42,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:42,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 161 [2025-02-08 05:43:42,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:42,981 INFO L124 PetriNetUnfolderBase]: 1885/6101 cut-off events. [2025-02-08 05:43:42,982 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-02-08 05:43:42,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9490 conditions, 6101 events. 1885/6101 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 57034 event pairs, 933 based on Foata normal form. 0/5505 useless extension candidates. Maximal degree in co-relation 5970. Up to 2653 conditions per place. [2025-02-08 05:43:43,019 INFO L140 encePairwiseOnDemand]: 146/161 looper letters, 50 selfloop transitions, 38 changer transitions 0/212 dead transitions. [2025-02-08 05:43:43,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 212 transitions, 636 flow [2025-02-08 05:43:43,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 845 transitions. [2025-02-08 05:43:43,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8747412008281573 [2025-02-08 05:43:43,022 INFO L175 Difference]: Start difference. First operand has 161 places, 158 transitions, 347 flow. Second operand 6 states and 845 transitions. [2025-02-08 05:43:43,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 212 transitions, 636 flow [2025-02-08 05:43:43,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 212 transitions, 636 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:43,027 INFO L231 Difference]: Finished difference. Result has 171 places, 195 transitions, 601 flow [2025-02-08 05:43:43,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=601, PETRI_PLACES=171, PETRI_TRANSITIONS=195} [2025-02-08 05:43:43,028 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 8 predicate places. [2025-02-08 05:43:43,028 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 195 transitions, 601 flow [2025-02-08 05:43:43,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:43,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:43,029 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] [2025-02-08 05:43:43,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:43:43,029 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:43:43,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:43,030 INFO L85 PathProgramCache]: Analyzing trace with hash 752179466, now seen corresponding path program 1 times [2025-02-08 05:43:43,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:43,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386347154] [2025-02-08 05:43:43,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:43,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:43,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:43:43,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:43:43,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:43,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:43,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:43,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:43,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386347154] [2025-02-08 05:43:43,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386347154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:43,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:43,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:43,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747662355] [2025-02-08 05:43:43,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:43,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:43:43,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:43,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:43:43,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:43:43,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 161 [2025-02-08 05:43:43,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 195 transitions, 601 flow. Second operand has 5 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:43,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:43,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 161 [2025-02-08 05:43:43,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:43,729 INFO L124 PetriNetUnfolderBase]: 798/3960 cut-off events. [2025-02-08 05:43:43,729 INFO L125 PetriNetUnfolderBase]: For 410/621 co-relation queries the response was YES. [2025-02-08 05:43:43,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6402 conditions, 3960 events. 798/3960 cut-off events. For 410/621 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 35460 event pairs, 305 based on Foata normal form. 2/3595 useless extension candidates. Maximal degree in co-relation 3889. Up to 1048 conditions per place. [2025-02-08 05:43:43,766 INFO L140 encePairwiseOnDemand]: 153/161 looper letters, 20 selfloop transitions, 2 changer transitions 5/203 dead transitions. [2025-02-08 05:43:43,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 203 transitions, 671 flow [2025-02-08 05:43:43,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:43,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 874 transitions. [2025-02-08 05:43:43,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2025-02-08 05:43:43,769 INFO L175 Difference]: Start difference. First operand has 171 places, 195 transitions, 601 flow. Second operand 6 states and 874 transitions. [2025-02-08 05:43:43,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 203 transitions, 671 flow [2025-02-08 05:43:43,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 203 transitions, 671 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:43,778 INFO L231 Difference]: Finished difference. Result has 180 places, 196 transitions, 623 flow [2025-02-08 05:43:43,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=623, PETRI_PLACES=180, PETRI_TRANSITIONS=196} [2025-02-08 05:43:43,779 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 17 predicate places. [2025-02-08 05:43:43,779 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 196 transitions, 623 flow [2025-02-08 05:43:43,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:43,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:43,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:43,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:43:43,780 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:43:43,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:43,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1996025720, now seen corresponding path program 1 times [2025-02-08 05:43:43,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:43,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494147076] [2025-02-08 05:43:43,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:43,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:43,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 05:43:43,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 05:43:43,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:43,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:43,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:43,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494147076] [2025-02-08 05:43:43,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494147076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:43,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:43,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:43,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816029631] [2025-02-08 05:43:43,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:43,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:43,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:43,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:43,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:43,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 161 [2025-02-08 05:43:43,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 196 transitions, 623 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:43,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:43,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 161 [2025-02-08 05:43:43,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:44,429 INFO L124 PetriNetUnfolderBase]: 912/4116 cut-off events. [2025-02-08 05:43:44,429 INFO L125 PetriNetUnfolderBase]: For 717/859 co-relation queries the response was YES. [2025-02-08 05:43:44,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7371 conditions, 4116 events. 912/4116 cut-off events. For 717/859 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 38499 event pairs, 173 based on Foata normal form. 1/3838 useless extension candidates. Maximal degree in co-relation 7272. Up to 1139 conditions per place. [2025-02-08 05:43:44,461 INFO L140 encePairwiseOnDemand]: 147/161 looper letters, 29 selfloop transitions, 10 changer transitions 0/213 dead transitions. [2025-02-08 05:43:44,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 213 transitions, 746 flow [2025-02-08 05:43:44,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:44,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:44,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2025-02-08 05:43:44,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9461697722567288 [2025-02-08 05:43:44,464 INFO L175 Difference]: Start difference. First operand has 180 places, 196 transitions, 623 flow. Second operand 3 states and 457 transitions. [2025-02-08 05:43:44,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 213 transitions, 746 flow [2025-02-08 05:43:44,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 213 transitions, 734 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-08 05:43:44,477 INFO L231 Difference]: Finished difference. Result has 177 places, 206 transitions, 699 flow [2025-02-08 05:43:44,478 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=177, PETRI_TRANSITIONS=206} [2025-02-08 05:43:44,478 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 14 predicate places. [2025-02-08 05:43:44,478 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 206 transitions, 699 flow [2025-02-08 05:43:44,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:44,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:44,479 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:44,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:43:44,479 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:43:44,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:44,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1467547587, now seen corresponding path program 1 times [2025-02-08 05:43:44,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:44,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831256550] [2025-02-08 05:43:44,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:44,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:44,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 05:43:44,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 05:43:44,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:44,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:44,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:44,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:44,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831256550] [2025-02-08 05:43:44,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831256550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:44,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:44,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:44,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164114423] [2025-02-08 05:43:44,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:44,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:44,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:44,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:44,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:44,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 161 [2025-02-08 05:43:44,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 206 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:44,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:44,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 161 [2025-02-08 05:43:44,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:45,102 INFO L124 PetriNetUnfolderBase]: 1026/4697 cut-off events. [2025-02-08 05:43:45,103 INFO L125 PetriNetUnfolderBase]: For 997/1180 co-relation queries the response was YES. [2025-02-08 05:43:45,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8521 conditions, 4697 events. 1026/4697 cut-off events. For 997/1180 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 45626 event pairs, 191 based on Foata normal form. 9/4381 useless extension candidates. Maximal degree in co-relation 7423. Up to 1280 conditions per place. [2025-02-08 05:43:45,141 INFO L140 encePairwiseOnDemand]: 154/161 looper letters, 26 selfloop transitions, 9 changer transitions 0/217 dead transitions. [2025-02-08 05:43:45,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 217 transitions, 815 flow [2025-02-08 05:43:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:45,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:45,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2025-02-08 05:43:45,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9399585921325052 [2025-02-08 05:43:45,144 INFO L175 Difference]: Start difference. First operand has 177 places, 206 transitions, 699 flow. Second operand 3 states and 454 transitions. [2025-02-08 05:43:45,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 217 transitions, 815 flow [2025-02-08 05:43:45,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 217 transitions, 789 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:43:45,156 INFO L231 Difference]: Finished difference. Result has 179 places, 213 transitions, 755 flow [2025-02-08 05:43:45,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=755, PETRI_PLACES=179, PETRI_TRANSITIONS=213} [2025-02-08 05:43:45,157 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 16 predicate places. [2025-02-08 05:43:45,157 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 213 transitions, 755 flow [2025-02-08 05:43:45,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:45,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:45,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:45,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:43:45,158 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:43:45,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:45,159 INFO L85 PathProgramCache]: Analyzing trace with hash 255355466, now seen corresponding path program 1 times [2025-02-08 05:43:45,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:45,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120714596] [2025-02-08 05:43:45,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:45,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:45,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 05:43:45,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 05:43:45,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:45,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:45,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:45,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120714596] [2025-02-08 05:43:45,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120714596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:45,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:45,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:45,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210896794] [2025-02-08 05:43:45,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:45,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:43:45,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:45,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:43:45,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:43:45,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 161 [2025-02-08 05:43:45,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 213 transitions, 755 flow. Second operand has 6 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:45,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:45,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 161 [2025-02-08 05:43:45,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:46,939 INFO L124 PetriNetUnfolderBase]: 3464/12427 cut-off events. [2025-02-08 05:43:46,940 INFO L125 PetriNetUnfolderBase]: For 3139/3396 co-relation queries the response was YES. [2025-02-08 05:43:46,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25448 conditions, 12427 events. 3464/12427 cut-off events. For 3139/3396 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 139874 event pairs, 1210 based on Foata normal form. 8/11545 useless extension candidates. Maximal degree in co-relation 23312. Up to 4790 conditions per place. [2025-02-08 05:43:47,025 INFO L140 encePairwiseOnDemand]: 146/161 looper letters, 84 selfloop transitions, 38 changer transitions 0/268 dead transitions. [2025-02-08 05:43:47,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 268 transitions, 1179 flow [2025-02-08 05:43:47,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:47,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:47,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 856 transitions. [2025-02-08 05:43:47,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8861283643892339 [2025-02-08 05:43:47,028 INFO L175 Difference]: Start difference. First operand has 179 places, 213 transitions, 755 flow. Second operand 6 states and 856 transitions. [2025-02-08 05:43:47,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 268 transitions, 1179 flow [2025-02-08 05:43:47,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 268 transitions, 1161 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:43:47,051 INFO L231 Difference]: Finished difference. Result has 187 places, 250 transitions, 1055 flow [2025-02-08 05:43:47,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1055, PETRI_PLACES=187, PETRI_TRANSITIONS=250} [2025-02-08 05:43:47,051 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 24 predicate places. [2025-02-08 05:43:47,051 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 250 transitions, 1055 flow [2025-02-08 05:43:47,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:47,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:47,052 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:47,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:43:47,053 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:43:47,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:47,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1240670615, now seen corresponding path program 1 times [2025-02-08 05:43:47,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:47,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150292248] [2025-02-08 05:43:47,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:47,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:47,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 05:43:47,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 05:43:47,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:47,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:47,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:47,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150292248] [2025-02-08 05:43:47,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150292248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:47,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:47,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:47,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256773490] [2025-02-08 05:43:47,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:47,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:43:47,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:47,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:43:47,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:43:47,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 161 [2025-02-08 05:43:47,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 250 transitions, 1055 flow. Second operand has 6 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:47,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:47,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 161 [2025-02-08 05:43:47,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:49,642 INFO L124 PetriNetUnfolderBase]: 6300/19929 cut-off events. [2025-02-08 05:43:49,642 INFO L125 PetriNetUnfolderBase]: For 10025/12230 co-relation queries the response was YES. [2025-02-08 05:43:49,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48405 conditions, 19929 events. 6300/19929 cut-off events. For 10025/12230 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 223843 event pairs, 1619 based on Foata normal form. 46/18514 useless extension candidates. Maximal degree in co-relation 42504. Up to 8071 conditions per place. [2025-02-08 05:43:49,772 INFO L140 encePairwiseOnDemand]: 142/161 looper letters, 139 selfloop transitions, 118 changer transitions 0/405 dead transitions. [2025-02-08 05:43:49,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 405 transitions, 2443 flow [2025-02-08 05:43:49,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:49,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 882 transitions. [2025-02-08 05:43:49,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9130434782608695 [2025-02-08 05:43:49,775 INFO L175 Difference]: Start difference. First operand has 187 places, 250 transitions, 1055 flow. Second operand 6 states and 882 transitions. [2025-02-08 05:43:49,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 405 transitions, 2443 flow [2025-02-08 05:43:49,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 405 transitions, 2311 flow, removed 66 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:49,844 INFO L231 Difference]: Finished difference. Result has 196 places, 362 transitions, 2121 flow [2025-02-08 05:43:49,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2121, PETRI_PLACES=196, PETRI_TRANSITIONS=362} [2025-02-08 05:43:49,845 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 33 predicate places. [2025-02-08 05:43:49,845 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 362 transitions, 2121 flow [2025-02-08 05:43:49,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:49,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:49,847 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:49,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:43:49,848 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:43:49,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:49,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1137909122, now seen corresponding path program 1 times [2025-02-08 05:43:49,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:49,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575987406] [2025-02-08 05:43:49,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:49,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:49,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 05:43:49,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 05:43:49,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:49,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:49,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:49,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575987406] [2025-02-08 05:43:49,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575987406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:49,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:49,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:49,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806038981] [2025-02-08 05:43:49,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:49,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:49,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:49,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:49,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:49,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 161 [2025-02-08 05:43:49,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 362 transitions, 2121 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:49,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:49,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 161 [2025-02-08 05:43:49,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:52,040 INFO L124 PetriNetUnfolderBase]: 4389/15297 cut-off events. [2025-02-08 05:43:52,040 INFO L125 PetriNetUnfolderBase]: For 11419/13270 co-relation queries the response was YES. [2025-02-08 05:43:52,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41802 conditions, 15297 events. 4389/15297 cut-off events. For 11419/13270 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 172913 event pairs, 353 based on Foata normal form. 18/14606 useless extension candidates. Maximal degree in co-relation 37703. Up to 3695 conditions per place. [2025-02-08 05:43:52,137 INFO L140 encePairwiseOnDemand]: 154/161 looper letters, 28 selfloop transitions, 11 changer transitions 0/372 dead transitions. [2025-02-08 05:43:52,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 372 transitions, 2236 flow [2025-02-08 05:43:52,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:52,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2025-02-08 05:43:52,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.937888198757764 [2025-02-08 05:43:52,139 INFO L175 Difference]: Start difference. First operand has 196 places, 362 transitions, 2121 flow. Second operand 3 states and 453 transitions. [2025-02-08 05:43:52,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 372 transitions, 2236 flow [2025-02-08 05:43:52,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 372 transitions, 2200 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:52,311 INFO L231 Difference]: Finished difference. Result has 200 places, 369 transitions, 2173 flow [2025-02-08 05:43:52,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=2085, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2173, PETRI_PLACES=200, PETRI_TRANSITIONS=369} [2025-02-08 05:43:52,312 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 37 predicate places. [2025-02-08 05:43:52,312 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 369 transitions, 2173 flow [2025-02-08 05:43:52,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:52,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:52,312 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:52,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:43:52,313 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:43:52,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:52,313 INFO L85 PathProgramCache]: Analyzing trace with hash -335905998, now seen corresponding path program 1 times [2025-02-08 05:43:52,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:52,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56415798] [2025-02-08 05:43:52,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:52,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:52,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 05:43:52,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 05:43:52,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:52,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:43:52,338 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:43:52,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 05:43:52,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 05:43:52,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:52,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:43:52,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:43:52,373 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:43:52,373 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2025-02-08 05:43:52,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-02-08 05:43:52,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-02-08 05:43:52,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-02-08 05:43:52,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-02-08 05:43:52,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2025-02-08 05:43:52,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2025-02-08 05:43:52,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-02-08 05:43:52,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-02-08 05:43:52,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-02-08 05:43:52,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2025-02-08 05:43:52,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2025-02-08 05:43:52,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-02-08 05:43:52,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-02-08 05:43:52,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-02-08 05:43:52,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-02-08 05:43:52,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-02-08 05:43:52,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-02-08 05:43:52,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-02-08 05:43:52,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-02-08 05:43:52,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:43:52,375 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:52,376 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:43:52,376 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:43:52,420 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:43:52,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 201 transitions, 429 flow [2025-02-08 05:43:52,463 INFO L124 PetriNetUnfolderBase]: 9/421 cut-off events. [2025-02-08 05:43:52,464 INFO L125 PetriNetUnfolderBase]: For 19/22 co-relation queries the response was YES. [2025-02-08 05:43:52,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 421 events. 9/421 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1306 event pairs, 1 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 270. Up to 12 conditions per place. [2025-02-08 05:43:52,466 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 201 transitions, 429 flow [2025-02-08 05:43:52,470 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 201 transitions, 429 flow [2025-02-08 05:43:52,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:43:52,471 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;@d6cf543, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:43:52,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-02-08 05:43:52,473 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:43:52,474 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2025-02-08 05:43:52,474 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:43:52,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:52,474 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:52,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:43:52,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:52,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1295010833, now seen corresponding path program 1 times [2025-02-08 05:43:52,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:52,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912722637] [2025-02-08 05:43:52,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:52,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:52,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:43:52,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:43:52,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:52,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:52,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:52,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:52,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912722637] [2025-02-08 05:43:52,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912722637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:52,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:52,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:52,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246774608] [2025-02-08 05:43:52,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:52,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:52,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:52,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:52,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:52,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 201 [2025-02-08 05:43:52,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 201 transitions, 429 flow. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:52,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:52,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 201 [2025-02-08 05:43:52,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:53,091 INFO L124 PetriNetUnfolderBase]: 656/5099 cut-off events. [2025-02-08 05:43:53,092 INFO L125 PetriNetUnfolderBase]: For 337/337 co-relation queries the response was YES. [2025-02-08 05:43:53,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6310 conditions, 5099 events. 656/5099 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 51172 event pairs, 643 based on Foata normal form. 1/4437 useless extension candidates. Maximal degree in co-relation 4712. Up to 1052 conditions per place. [2025-02-08 05:43:53,129 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 20 selfloop transitions, 2 changer transitions 1/199 dead transitions. [2025-02-08 05:43:53,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 199 transitions, 469 flow [2025-02-08 05:43:53,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:53,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2025-02-08 05:43:53,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9203980099502488 [2025-02-08 05:43:53,131 INFO L175 Difference]: Start difference. First operand has 204 places, 201 transitions, 429 flow. Second operand 3 states and 555 transitions. [2025-02-08 05:43:53,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 199 transitions, 469 flow [2025-02-08 05:43:53,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 199 transitions, 469 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:53,134 INFO L231 Difference]: Finished difference. Result has 205 places, 198 transitions, 427 flow [2025-02-08 05:43:53,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=427, PETRI_PLACES=205, PETRI_TRANSITIONS=198} [2025-02-08 05:43:53,135 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, 1 predicate places. [2025-02-08 05:43:53,135 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 198 transitions, 427 flow [2025-02-08 05:43:53,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:53,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:53,136 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] [2025-02-08 05:43:53,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:43:53,136 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:43:53,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:53,137 INFO L85 PathProgramCache]: Analyzing trace with hash -2093753222, now seen corresponding path program 1 times [2025-02-08 05:43:53,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:53,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500790440] [2025-02-08 05:43:53,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:53,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:53,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:43:53,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:43:53,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:53,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:53,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:53,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500790440] [2025-02-08 05:43:53,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500790440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:53,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:53,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:53,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194950831] [2025-02-08 05:43:53,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:53,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:53,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:53,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:53,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:53,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 201 [2025-02-08 05:43:53,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 198 transitions, 427 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:53,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:53,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 201 [2025-02-08 05:43:53,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:53,819 INFO L124 PetriNetUnfolderBase]: 1275/6749 cut-off events. [2025-02-08 05:43:53,819 INFO L125 PetriNetUnfolderBase]: For 527/527 co-relation queries the response was YES. [2025-02-08 05:43:53,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8947 conditions, 6749 events. 1275/6749 cut-off events. For 527/527 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 68961 event pairs, 437 based on Foata normal form. 0/6232 useless extension candidates. Maximal degree in co-relation 8905. Up to 1872 conditions per place. [2025-02-08 05:43:53,868 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 29 selfloop transitions, 4 changer transitions 0/206 dead transitions. [2025-02-08 05:43:53,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 206 transitions, 521 flow [2025-02-08 05:43:53,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:53,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2025-02-08 05:43:53,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9320066334991708 [2025-02-08 05:43:53,869 INFO L175 Difference]: Start difference. First operand has 205 places, 198 transitions, 427 flow. Second operand 3 states and 562 transitions. [2025-02-08 05:43:53,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 206 transitions, 521 flow [2025-02-08 05:43:53,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 206 transitions, 517 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:43:53,872 INFO L231 Difference]: Finished difference. Result has 201 places, 198 transitions, 443 flow [2025-02-08 05:43:53,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=443, PETRI_PLACES=201, PETRI_TRANSITIONS=198} [2025-02-08 05:43:53,872 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -3 predicate places. [2025-02-08 05:43:53,872 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 198 transitions, 443 flow [2025-02-08 05:43:53,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:53,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:53,873 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] [2025-02-08 05:43:53,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:43:53,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:43:53,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:53,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2136812589, now seen corresponding path program 1 times [2025-02-08 05:43:53,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:53,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432819365] [2025-02-08 05:43:53,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:53,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:53,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:43:53,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:43:53,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:53,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:54,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:54,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:54,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432819365] [2025-02-08 05:43:54,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432819365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:54,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:54,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:54,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105036853] [2025-02-08 05:43:54,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:54,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:43:54,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:54,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:43:54,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:43:54,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 201 [2025-02-08 05:43:54,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 198 transitions, 443 flow. Second operand has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:54,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:54,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 201 [2025-02-08 05:43:54,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:00,639 INFO L124 PetriNetUnfolderBase]: 24762/64711 cut-off events. [2025-02-08 05:44:00,639 INFO L125 PetriNetUnfolderBase]: For 2236/2236 co-relation queries the response was YES. [2025-02-08 05:44:00,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102379 conditions, 64711 events. 24762/64711 cut-off events. For 2236/2236 co-relation queries the response was YES. Maximal size of possible extension queue 1909. Compared 805096 event pairs, 14369 based on Foata normal form. 0/58481 useless extension candidates. Maximal degree in co-relation 62909. Up to 30792 conditions per place. [2025-02-08 05:44:01,008 INFO L140 encePairwiseOnDemand]: 182/201 looper letters, 67 selfloop transitions, 54 changer transitions 0/277 dead transitions. [2025-02-08 05:44:01,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 277 transitions, 855 flow [2025-02-08 05:44:01,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:44:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:44:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1070 transitions. [2025-02-08 05:44:01,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8872305140961857 [2025-02-08 05:44:01,011 INFO L175 Difference]: Start difference. First operand has 201 places, 198 transitions, 443 flow. Second operand 6 states and 1070 transitions. [2025-02-08 05:44:01,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 277 transitions, 855 flow [2025-02-08 05:44:01,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 277 transitions, 855 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:44:01,017 INFO L231 Difference]: Finished difference. Result has 211 places, 251 transitions, 801 flow [2025-02-08 05:44:01,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=801, PETRI_PLACES=211, PETRI_TRANSITIONS=251} [2025-02-08 05:44:01,018 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, 7 predicate places. [2025-02-08 05:44:01,018 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 251 transitions, 801 flow [2025-02-08 05:44:01,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:01,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:01,019 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] [2025-02-08 05:44:01,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:44:01,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:44:01,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:01,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2052847158, now seen corresponding path program 1 times [2025-02-08 05:44:01,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:01,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882591802] [2025-02-08 05:44:01,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:01,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:01,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:44:01,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:44:01,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:01,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:44:01,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:01,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882591802] [2025-02-08 05:44:01,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882591802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:01,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:01,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:44:01,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572059149] [2025-02-08 05:44:01,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:01,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:44:01,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:01,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:44:01,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:44:01,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 201 [2025-02-08 05:44:01,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 251 transitions, 801 flow. Second operand has 5 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:01,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:01,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 201 [2025-02-08 05:44:01,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:04,960 INFO L124 PetriNetUnfolderBase]: 10026/35624 cut-off events. [2025-02-08 05:44:04,960 INFO L125 PetriNetUnfolderBase]: For 4957/6485 co-relation queries the response was YES. [2025-02-08 05:44:05,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59446 conditions, 35624 events. 10026/35624 cut-off events. For 4957/6485 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 439588 event pairs, 5453 based on Foata normal form. 1/32402 useless extension candidates. Maximal degree in co-relation 28968. Up to 12805 conditions per place. [2025-02-08 05:44:05,411 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 24 selfloop transitions, 2 changer transitions 5/259 dead transitions. [2025-02-08 05:44:05,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 259 transitions, 879 flow [2025-02-08 05:44:05,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:44:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:44:05,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1094 transitions. [2025-02-08 05:44:05,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9071310116086235 [2025-02-08 05:44:05,414 INFO L175 Difference]: Start difference. First operand has 211 places, 251 transitions, 801 flow. Second operand 6 states and 1094 transitions. [2025-02-08 05:44:05,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 259 transitions, 879 flow [2025-02-08 05:44:05,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 259 transitions, 879 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:44:05,448 INFO L231 Difference]: Finished difference. Result has 220 places, 252 transitions, 823 flow [2025-02-08 05:44:05,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=823, PETRI_PLACES=220, PETRI_TRANSITIONS=252} [2025-02-08 05:44:05,448 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, 16 predicate places. [2025-02-08 05:44:05,448 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 252 transitions, 823 flow [2025-02-08 05:44:05,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:05,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:05,449 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] [2025-02-08 05:44:05,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:44:05,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:44:05,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:05,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1032267847, now seen corresponding path program 1 times [2025-02-08 05:44:05,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:05,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859734379] [2025-02-08 05:44:05,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:05,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:05,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 05:44:05,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 05:44:05,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:05,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:05,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:44:05,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:05,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859734379] [2025-02-08 05:44:05,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859734379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:05,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:05,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:44:05,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891677196] [2025-02-08 05:44:05,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:05,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:44:05,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:05,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:44:05,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:44:05,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 201 [2025-02-08 05:44:05,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 252 transitions, 823 flow. Second operand has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:05,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:05,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 201 [2025-02-08 05:44:05,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:13,577 INFO L124 PetriNetUnfolderBase]: 21144/68810 cut-off events. [2025-02-08 05:44:13,578 INFO L125 PetriNetUnfolderBase]: For 17647/23547 co-relation queries the response was YES. [2025-02-08 05:44:14,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127972 conditions, 68810 events. 21144/68810 cut-off events. For 17647/23547 co-relation queries the response was YES. Maximal size of possible extension queue 2354. Compared 965156 event pairs, 6057 based on Foata normal form. 13/62918 useless extension candidates. Maximal degree in co-relation 127872. Up to 22806 conditions per place. [2025-02-08 05:44:14,267 INFO L140 encePairwiseOnDemand]: 180/201 looper letters, 44 selfloop transitions, 15 changer transitions 0/278 dead transitions. [2025-02-08 05:44:14,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 278 transitions, 1014 flow [2025-02-08 05:44:14,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:44:14,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:44:14,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 566 transitions. [2025-02-08 05:44:14,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9386401326699834 [2025-02-08 05:44:14,269 INFO L175 Difference]: Start difference. First operand has 220 places, 252 transitions, 823 flow. Second operand 3 states and 566 transitions. [2025-02-08 05:44:14,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 278 transitions, 1014 flow [2025-02-08 05:44:14,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 278 transitions, 1002 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-08 05:44:14,810 INFO L231 Difference]: Finished difference. Result has 217 places, 267 transitions, 943 flow [2025-02-08 05:44:14,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=943, PETRI_PLACES=217, PETRI_TRANSITIONS=267} [2025-02-08 05:44:14,811 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, 13 predicate places. [2025-02-08 05:44:14,811 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 267 transitions, 943 flow [2025-02-08 05:44:14,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:14,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:14,811 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:44:14,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:44:14,811 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:44:14,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:14,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1759941772, now seen corresponding path program 1 times [2025-02-08 05:44:14,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:14,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845586889] [2025-02-08 05:44:14,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:14,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:14,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 05:44:14,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 05:44:14,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:14,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:14,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:44:14,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:14,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845586889] [2025-02-08 05:44:14,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845586889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:14,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:14,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:44:14,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042575510] [2025-02-08 05:44:14,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:14,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:44:14,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:14,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:44:14,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:44:14,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 201 [2025-02-08 05:44:14,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 267 transitions, 943 flow. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:14,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:14,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 201 [2025-02-08 05:44:14,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:24,384 INFO L124 PetriNetUnfolderBase]: 25380/85435 cut-off events. [2025-02-08 05:44:24,384 INFO L125 PetriNetUnfolderBase]: For 25630/32783 co-relation queries the response was YES. [2025-02-08 05:44:24,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161591 conditions, 85435 events. 25380/85435 cut-off events. For 25630/32783 co-relation queries the response was YES. Maximal size of possible extension queue 2891. Compared 1254090 event pairs, 7161 based on Foata normal form. 168/78732 useless extension candidates. Maximal degree in co-relation 131586. Up to 27844 conditions per place. [2025-02-08 05:44:25,240 INFO L140 encePairwiseOnDemand]: 191/201 looper letters, 40 selfloop transitions, 16 changer transitions 0/289 dead transitions. [2025-02-08 05:44:25,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 289 transitions, 1153 flow [2025-02-08 05:44:25,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:44:25,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:44:25,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2025-02-08 05:44:25,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9402985074626866 [2025-02-08 05:44:25,242 INFO L175 Difference]: Start difference. First operand has 217 places, 267 transitions, 943 flow. Second operand 3 states and 567 transitions. [2025-02-08 05:44:25,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 289 transitions, 1153 flow [2025-02-08 05:44:26,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 289 transitions, 1111 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:44:26,094 INFO L231 Difference]: Finished difference. Result has 219 places, 281 transitions, 1059 flow [2025-02-08 05:44:26,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1059, PETRI_PLACES=219, PETRI_TRANSITIONS=281} [2025-02-08 05:44:26,095 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, 15 predicate places. [2025-02-08 05:44:26,095 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 281 transitions, 1059 flow [2025-02-08 05:44:26,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:26,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:26,096 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:44:26,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:44:26,096 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:44:26,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:26,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1663140487, now seen corresponding path program 1 times [2025-02-08 05:44:26,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:26,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856042183] [2025-02-08 05:44:26,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:26,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:26,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 05:44:26,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 05:44:26,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:26,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:44:26,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:26,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856042183] [2025-02-08 05:44:26,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856042183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:26,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:26,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:44:26,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218785211] [2025-02-08 05:44:26,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:26,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:44:26,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:26,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:44:26,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:44:26,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 201 [2025-02-08 05:44:26,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 281 transitions, 1059 flow. Second operand has 6 states, 6 states have (on average 162.16666666666666) internal successors, (973), 6 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:26,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:26,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 201 [2025-02-08 05:44:26,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand