./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/queue_ok.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:56:47,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:56:47,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 21:56:47,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:56:47,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:56:47,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:56:47,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:56:47,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:56:47,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:56:47,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:56:47,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:56:47,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:56:47,628 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:56:47,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:56:47,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:56:47,629 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:56:47,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:56:47,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:56:47,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:56:47,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:56:47,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:56:47,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:56:47,630 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 21:56:47,630 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 21:56:47,630 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:56:47,630 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:56:47,630 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:56:47,630 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:56:47,630 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:56:47,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:56:47,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:56:47,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:56:47,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:56:47,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:56:47,631 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:56:47,631 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:56:47,631 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:56:47,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:56:47,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:56:47,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:56:47,632 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:56:47,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:56:47,632 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2025-03-13 21:56:47,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:56:47,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:56:47,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:56:47,873 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:56:47,873 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:56:47,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok.i [2025-03-13 21:56:48,973 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b987f179/b767e61712c44a478d4163de1d6cfb43/FLAG4a5bce319 [2025-03-13 21:56:49,294 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:56:49,297 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok.i [2025-03-13 21:56:49,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b987f179/b767e61712c44a478d4163de1d6cfb43/FLAG4a5bce319 [2025-03-13 21:56:49,331 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b987f179/b767e61712c44a478d4163de1d6cfb43 [2025-03-13 21:56:49,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:56:49,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:56:49,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:56:49,339 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:56:49,343 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:56:49,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:56:49" (1/1) ... [2025-03-13 21:56:49,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46771357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:49, skipping insertion in model container [2025-03-13 21:56:49,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:56:49" (1/1) ... [2025-03-13 21:56:49,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:56:49,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:56:49,640 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:56:49,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:56:49,729 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:56:49,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:49 WrapperNode [2025-03-13 21:56:49,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:56:49,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:56:49,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:56:49,732 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:56:49,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:49" (1/1) ... [2025-03-13 21:56:49,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:49" (1/1) ... [2025-03-13 21:56:49,792 INFO L138 Inliner]: procedures = 274, calls = 94, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 409 [2025-03-13 21:56:49,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:56:49,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:56:49,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:56:49,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:56:49,801 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:49" (1/1) ... [2025-03-13 21:56:49,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:49" (1/1) ... [2025-03-13 21:56:49,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:49" (1/1) ... [2025-03-13 21:56:49,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:49" (1/1) ... [2025-03-13 21:56:49,838 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:49" (1/1) ... [2025-03-13 21:56:49,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:49" (1/1) ... [2025-03-13 21:56:49,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:49" (1/1) ... [2025-03-13 21:56:49,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:49" (1/1) ... [2025-03-13 21:56:49,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:56:49,853 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:56:49,853 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:56:49,853 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:56:49,854 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:49" (1/1) ... [2025-03-13 21:56:49,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:56:49,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:56:49,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:56:49,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:56:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-13 21:56:49,904 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-13 21:56:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-13 21:56:49,904 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-13 21:56:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:56:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 21:56:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 21:56:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:56:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:56:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 21:56:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:56:49,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:56:49,907 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:56:50,022 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:56:50,023 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:56:50,599 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:56:50,600 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:56:50,600 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:56:50,625 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:56:50,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:56:50 BoogieIcfgContainer [2025-03-13 21:56:50,626 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:56:50,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:56:50,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:56:50,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:56:50,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:56:49" (1/3) ... [2025-03-13 21:56:50,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@759b9b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:56:50, skipping insertion in model container [2025-03-13 21:56:50,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:49" (2/3) ... [2025-03-13 21:56:50,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@759b9b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:56:50, skipping insertion in model container [2025-03-13 21:56:50,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:56:50" (3/3) ... [2025-03-13 21:56:50,634 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2025-03-13 21:56:50,645 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:56:50,646 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok.i that has 3 procedures, 460 locations, 1 initial locations, 2 loop locations, and 33 error locations. [2025-03-13 21:56:50,647 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:56:50,794 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:56:50,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 466 places, 472 transitions, 958 flow [2025-03-13 21:56:50,965 INFO L124 PetriNetUnfolderBase]: 13/470 cut-off events. [2025-03-13 21:56:50,966 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:56:50,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 470 events. 13/470 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 740 event pairs, 0 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 309. Up to 3 conditions per place. [2025-03-13 21:56:50,980 INFO L82 GeneralOperation]: Start removeDead. Operand has 466 places, 472 transitions, 958 flow [2025-03-13 21:56:50,990 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 459 places, 465 transitions, 939 flow [2025-03-13 21:56:51,001 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:56:51,013 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;@4be24a67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:56:51,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-03-13 21:56:51,042 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:56:51,042 INFO L124 PetriNetUnfolderBase]: 0/70 cut-off events. [2025-03-13 21:56:51,042 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:56:51,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:51,043 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] [2025-03-13 21:56:51,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:56:51,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:51,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1038377964, now seen corresponding path program 1 times [2025-03-13 21:56:51,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:51,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118300031] [2025-03-13 21:56:51,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:51,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:51,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-13 21:56:51,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-13 21:56:51,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:51,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:51,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:51,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118300031] [2025-03-13 21:56:51,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118300031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:51,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:51,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:51,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912403249] [2025-03-13 21:56:51,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:51,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:51,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:51,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:51,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:51,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 472 [2025-03-13 21:56:51,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 465 transitions, 939 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:51,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:51,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 472 [2025-03-13 21:56:51,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:51,547 INFO L124 PetriNetUnfolderBase]: 40/986 cut-off events. [2025-03-13 21:56:51,548 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-13 21:56:51,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 986 events. 40/986 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4394 event pairs, 19 based on Foata normal form. 3/881 useless extension candidates. Maximal degree in co-relation 881. Up to 52 conditions per place. [2025-03-13 21:56:51,556 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 13 selfloop transitions, 2 changer transitions 0/452 dead transitions. [2025-03-13 21:56:51,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 452 transitions, 943 flow [2025-03-13 21:56:51,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:51,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:51,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2025-03-13 21:56:51,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.96045197740113 [2025-03-13 21:56:51,575 INFO L175 Difference]: Start difference. First operand has 459 places, 465 transitions, 939 flow. Second operand 3 states and 1360 transitions. [2025-03-13 21:56:51,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 452 transitions, 943 flow [2025-03-13 21:56:51,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 452 transitions, 938 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:56:51,586 INFO L231 Difference]: Finished difference. Result has 449 places, 452 transitions, 912 flow [2025-03-13 21:56:51,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=912, PETRI_PLACES=449, PETRI_TRANSITIONS=452} [2025-03-13 21:56:51,592 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -10 predicate places. [2025-03-13 21:56:51,593 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 452 transitions, 912 flow [2025-03-13 21:56:51,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:51,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:51,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:51,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:56:51,594 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:56:51,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:51,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1995106460, now seen corresponding path program 1 times [2025-03-13 21:56:51,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:51,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059550264] [2025-03-13 21:56:51,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:51,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:51,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-13 21:56:51,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-13 21:56:51,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:51,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:51,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:51,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:51,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059550264] [2025-03-13 21:56:51,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059550264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:51,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:51,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:51,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668050334] [2025-03-13 21:56:51,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:51,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:51,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:51,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:51,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:51,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 472 [2025-03-13 21:56:51,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 452 transitions, 912 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:51,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:51,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 472 [2025-03-13 21:56:51,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:51,871 INFO L124 PetriNetUnfolderBase]: 43/1114 cut-off events. [2025-03-13 21:56:51,871 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 21:56:51,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 1114 events. 43/1114 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5448 event pairs, 19 based on Foata normal form. 0/996 useless extension candidates. Maximal degree in co-relation 1104. Up to 52 conditions per place. [2025-03-13 21:56:51,879 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 13 selfloop transitions, 2 changer transitions 0/451 dead transitions. [2025-03-13 21:56:51,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 451 transitions, 940 flow [2025-03-13 21:56:51,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:51,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:51,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1357 transitions. [2025-03-13 21:56:51,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9583333333333334 [2025-03-13 21:56:51,885 INFO L175 Difference]: Start difference. First operand has 449 places, 452 transitions, 912 flow. Second operand 3 states and 1357 transitions. [2025-03-13 21:56:51,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 451 transitions, 940 flow [2025-03-13 21:56:51,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 451 transitions, 936 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:56:51,893 INFO L231 Difference]: Finished difference. Result has 448 places, 451 transitions, 910 flow [2025-03-13 21:56:51,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=910, PETRI_PLACES=448, PETRI_TRANSITIONS=451} [2025-03-13 21:56:51,896 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -11 predicate places. [2025-03-13 21:56:51,896 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 451 transitions, 910 flow [2025-03-13 21:56:51,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:51,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:51,897 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:51,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:56:51,897 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:56:51,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:51,899 INFO L85 PathProgramCache]: Analyzing trace with hash 651287665, now seen corresponding path program 1 times [2025-03-13 21:56:51,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:51,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019067387] [2025-03-13 21:56:51,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:51,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:51,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-13 21:56:51,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-13 21:56:51,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:51,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:52,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:52,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:52,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019067387] [2025-03-13 21:56:52,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019067387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:52,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:52,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:56:52,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770910435] [2025-03-13 21:56:52,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:52,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:56:52,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:52,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:56:52,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:56:52,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 472 [2025-03-13 21:56:52,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 451 transitions, 910 flow. Second operand has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:52,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:52,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 472 [2025-03-13 21:56:52,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:54,205 INFO L124 PetriNetUnfolderBase]: 2177/9184 cut-off events. [2025-03-13 21:56:54,206 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-13 21:56:54,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13285 conditions, 9184 events. 2177/9184 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 80052 event pairs, 1832 based on Foata normal form. 0/8228 useless extension candidates. Maximal degree in co-relation 13204. Up to 4013 conditions per place. [2025-03-13 21:56:54,257 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 100 selfloop transitions, 5 changer transitions 0/450 dead transitions. [2025-03-13 21:56:54,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 450 transitions, 1118 flow [2025-03-13 21:56:54,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:56:54,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:56:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2254 transitions. [2025-03-13 21:56:54,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7959039548022598 [2025-03-13 21:56:54,264 INFO L175 Difference]: Start difference. First operand has 448 places, 451 transitions, 910 flow. Second operand 6 states and 2254 transitions. [2025-03-13 21:56:54,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 450 transitions, 1118 flow [2025-03-13 21:56:54,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 450 transitions, 1114 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:56:54,271 INFO L231 Difference]: Finished difference. Result has 450 places, 450 transitions, 914 flow [2025-03-13 21:56:54,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=914, PETRI_PLACES=450, PETRI_TRANSITIONS=450} [2025-03-13 21:56:54,273 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -9 predicate places. [2025-03-13 21:56:54,273 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 450 transitions, 914 flow [2025-03-13 21:56:54,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:54,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:54,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:54,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:56:54,275 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:56:54,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:54,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1989225366, now seen corresponding path program 1 times [2025-03-13 21:56:54,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:54,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817390061] [2025-03-13 21:56:54,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:54,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:54,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-13 21:56:54,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-13 21:56:54,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:54,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:54,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:54,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:54,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817390061] [2025-03-13 21:56:54,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817390061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:54,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:54,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:56:54,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634188911] [2025-03-13 21:56:54,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:54,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:56:54,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:54,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:56:54,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:56:55,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 472 [2025-03-13 21:56:55,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 450 transitions, 914 flow. Second operand has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:55,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:55,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 472 [2025-03-13 21:56:55,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:56,356 INFO L124 PetriNetUnfolderBase]: 2177/9183 cut-off events. [2025-03-13 21:56:56,356 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-13 21:56:56,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13287 conditions, 9183 events. 2177/9183 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 80103 event pairs, 1832 based on Foata normal form. 0/8228 useless extension candidates. Maximal degree in co-relation 13190. Up to 4013 conditions per place. [2025-03-13 21:56:56,394 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 100 selfloop transitions, 5 changer transitions 0/449 dead transitions. [2025-03-13 21:56:56,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 449 transitions, 1122 flow [2025-03-13 21:56:56,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:56:56,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:56:56,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2254 transitions. [2025-03-13 21:56:56,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7959039548022598 [2025-03-13 21:56:56,399 INFO L175 Difference]: Start difference. First operand has 450 places, 450 transitions, 914 flow. Second operand 6 states and 2254 transitions. [2025-03-13 21:56:56,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 449 transitions, 1122 flow [2025-03-13 21:56:56,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 449 transitions, 1112 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:56:56,404 INFO L231 Difference]: Finished difference. Result has 449 places, 449 transitions, 912 flow [2025-03-13 21:56:56,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=912, PETRI_PLACES=449, PETRI_TRANSITIONS=449} [2025-03-13 21:56:56,405 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -10 predicate places. [2025-03-13 21:56:56,405 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 449 transitions, 912 flow [2025-03-13 21:56:56,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:56,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:56,406 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:56,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:56:56,407 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:56:56,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:56,407 INFO L85 PathProgramCache]: Analyzing trace with hash -674521394, now seen corresponding path program 1 times [2025-03-13 21:56:56,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:56,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873423402] [2025-03-13 21:56:56,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:56,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:56,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-13 21:56:56,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-13 21:56:56,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:56,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:56,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:56,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:56,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873423402] [2025-03-13 21:56:56,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873423402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:56,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:56,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:56:56,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874124808] [2025-03-13 21:56:56,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:56,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:56:56,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:56,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:56:56,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:56:57,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 472 [2025-03-13 21:56:57,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 449 transitions, 912 flow. Second operand has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:57,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:57,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 472 [2025-03-13 21:56:57,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:58,451 INFO L124 PetriNetUnfolderBase]: 2177/9182 cut-off events. [2025-03-13 21:56:58,452 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-13 21:56:58,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13286 conditions, 9182 events. 2177/9182 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 79914 event pairs, 1832 based on Foata normal form. 0/8228 useless extension candidates. Maximal degree in co-relation 13181. Up to 4013 conditions per place. [2025-03-13 21:56:58,487 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 100 selfloop transitions, 5 changer transitions 0/448 dead transitions. [2025-03-13 21:56:58,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 448 transitions, 1120 flow [2025-03-13 21:56:58,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:56:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:56:58,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2254 transitions. [2025-03-13 21:56:58,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7959039548022598 [2025-03-13 21:56:58,492 INFO L175 Difference]: Start difference. First operand has 449 places, 449 transitions, 912 flow. Second operand 6 states and 2254 transitions. [2025-03-13 21:56:58,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 448 transitions, 1120 flow [2025-03-13 21:56:58,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 448 transitions, 1110 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:56:58,497 INFO L231 Difference]: Finished difference. Result has 448 places, 448 transitions, 910 flow [2025-03-13 21:56:58,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=448, PETRI_TRANSITIONS=448} [2025-03-13 21:56:58,499 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -11 predicate places. [2025-03-13 21:56:58,499 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 448 transitions, 910 flow [2025-03-13 21:56:58,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:58,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:58,500 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:58,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:56:58,500 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:56:58,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:58,501 INFO L85 PathProgramCache]: Analyzing trace with hash 84007781, now seen corresponding path program 1 times [2025-03-13 21:56:58,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:58,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138178378] [2025-03-13 21:56:58,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:58,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:58,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-13 21:56:58,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-13 21:56:58,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:58,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:58,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:58,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138178378] [2025-03-13 21:56:58,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138178378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:58,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:58,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:56:58,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712019007] [2025-03-13 21:56:58,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:58,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:56:58,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:58,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:56:58,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:56:59,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 472 [2025-03-13 21:56:59,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 448 transitions, 910 flow. Second operand has 6 states, 6 states have (on average 407.1666666666667) internal successors, (2443), 6 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:59,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:59,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 472 [2025-03-13 21:56:59,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:00,018 INFO L124 PetriNetUnfolderBase]: 502/4907 cut-off events. [2025-03-13 21:57:00,019 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 21:57:00,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5777 conditions, 4907 events. 502/4907 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 39017 event pairs, 344 based on Foata normal form. 0/4325 useless extension candidates. Maximal degree in co-relation 5654. Up to 811 conditions per place. [2025-03-13 21:57:00,042 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 54 selfloop transitions, 5 changer transitions 0/447 dead transitions. [2025-03-13 21:57:00,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 447 transitions, 1026 flow [2025-03-13 21:57:00,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:00,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2484 transitions. [2025-03-13 21:57:00,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8771186440677966 [2025-03-13 21:57:00,047 INFO L175 Difference]: Start difference. First operand has 448 places, 448 transitions, 910 flow. Second operand 6 states and 2484 transitions. [2025-03-13 21:57:00,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 447 transitions, 1026 flow [2025-03-13 21:57:00,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 447 transitions, 1016 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:00,052 INFO L231 Difference]: Finished difference. Result has 447 places, 447 transitions, 908 flow [2025-03-13 21:57:00,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=908, PETRI_PLACES=447, PETRI_TRANSITIONS=447} [2025-03-13 21:57:00,053 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -12 predicate places. [2025-03-13 21:57:00,053 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 447 transitions, 908 flow [2025-03-13 21:57:00,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 407.1666666666667) internal successors, (2443), 6 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:00,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:00,055 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:00,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:57:00,055 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:00,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:00,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1788507416, now seen corresponding path program 1 times [2025-03-13 21:57:00,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:00,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865602711] [2025-03-13 21:57:00,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:00,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:00,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-13 21:57:00,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-13 21:57:00,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:00,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:00,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:00,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865602711] [2025-03-13 21:57:00,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865602711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:00,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:00,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:00,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450106829] [2025-03-13 21:57:00,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:00,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:00,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:00,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:00,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:00,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 472 [2025-03-13 21:57:00,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 447 transitions, 908 flow. Second operand has 6 states, 6 states have (on average 407.1666666666667) internal successors, (2443), 6 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:00,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:00,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 472 [2025-03-13 21:57:00,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:01,411 INFO L124 PetriNetUnfolderBase]: 502/4906 cut-off events. [2025-03-13 21:57:01,411 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 21:57:01,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5776 conditions, 4906 events. 502/4906 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 39174 event pairs, 344 based on Foata normal form. 0/4325 useless extension candidates. Maximal degree in co-relation 5615. Up to 811 conditions per place. [2025-03-13 21:57:01,430 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 54 selfloop transitions, 5 changer transitions 0/446 dead transitions. [2025-03-13 21:57:01,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 446 transitions, 1024 flow [2025-03-13 21:57:01,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:01,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2484 transitions. [2025-03-13 21:57:01,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8771186440677966 [2025-03-13 21:57:01,434 INFO L175 Difference]: Start difference. First operand has 447 places, 447 transitions, 908 flow. Second operand 6 states and 2484 transitions. [2025-03-13 21:57:01,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 446 transitions, 1024 flow [2025-03-13 21:57:01,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 446 transitions, 1014 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:01,439 INFO L231 Difference]: Finished difference. Result has 446 places, 446 transitions, 906 flow [2025-03-13 21:57:01,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=906, PETRI_PLACES=446, PETRI_TRANSITIONS=446} [2025-03-13 21:57:01,440 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -13 predicate places. [2025-03-13 21:57:01,440 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 446 transitions, 906 flow [2025-03-13 21:57:01,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 407.1666666666667) internal successors, (2443), 6 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:01,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:01,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:01,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:57:01,442 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:01,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:01,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1108378393, now seen corresponding path program 1 times [2025-03-13 21:57:01,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:01,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720997799] [2025-03-13 21:57:01,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:01,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:01,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-13 21:57:01,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-13 21:57:01,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:01,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:01,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:01,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720997799] [2025-03-13 21:57:01,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720997799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:01,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:01,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:01,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299047710] [2025-03-13 21:57:01,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:01,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:01,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:01,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:01,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:01,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 472 [2025-03-13 21:57:01,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 446 transitions, 906 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:01,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:01,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 472 [2025-03-13 21:57:01,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:01,631 INFO L124 PetriNetUnfolderBase]: 53/1041 cut-off events. [2025-03-13 21:57:01,631 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-13 21:57:01,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 1041 events. 53/1041 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4919 event pairs, 12 based on Foata normal form. 0/937 useless extension candidates. Maximal degree in co-relation 1009. Up to 56 conditions per place. [2025-03-13 21:57:01,638 INFO L140 encePairwiseOnDemand]: 467/472 looper letters, 17 selfloop transitions, 4 changer transitions 0/454 dead transitions. [2025-03-13 21:57:01,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 454 transitions, 967 flow [2025-03-13 21:57:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:01,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:01,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1375 transitions. [2025-03-13 21:57:01,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971045197740113 [2025-03-13 21:57:01,643 INFO L175 Difference]: Start difference. First operand has 446 places, 446 transitions, 906 flow. Second operand 3 states and 1375 transitions. [2025-03-13 21:57:01,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 454 transitions, 967 flow [2025-03-13 21:57:01,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 454 transitions, 957 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:01,653 INFO L231 Difference]: Finished difference. Result has 445 places, 449 transitions, 926 flow [2025-03-13 21:57:01,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=926, PETRI_PLACES=445, PETRI_TRANSITIONS=449} [2025-03-13 21:57:01,654 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -14 predicate places. [2025-03-13 21:57:01,656 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 449 transitions, 926 flow [2025-03-13 21:57:01,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:01,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:01,657 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:01,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:57:01,657 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:01,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:01,658 INFO L85 PathProgramCache]: Analyzing trace with hash 874979927, now seen corresponding path program 1 times [2025-03-13 21:57:01,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:01,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288260101] [2025-03-13 21:57:01,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:01,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:01,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-13 21:57:01,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-13 21:57:01,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:01,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:01,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:01,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:01,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288260101] [2025-03-13 21:57:01,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288260101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:01,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:01,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:01,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345679306] [2025-03-13 21:57:01,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:01,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:01,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:01,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:01,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:01,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 472 [2025-03-13 21:57:01,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 449 transitions, 926 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:01,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:01,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 472 [2025-03-13 21:57:01,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:01,900 INFO L124 PetriNetUnfolderBase]: 96/2101 cut-off events. [2025-03-13 21:57:01,900 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-13 21:57:01,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2279 conditions, 2101 events. 96/2101 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 13704 event pairs, 24 based on Foata normal form. 0/1880 useless extension candidates. Maximal degree in co-relation 1965. Up to 85 conditions per place. [2025-03-13 21:57:01,910 INFO L140 encePairwiseOnDemand]: 467/472 looper letters, 16 selfloop transitions, 4 changer transitions 0/456 dead transitions. [2025-03-13 21:57:01,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 456 transitions, 981 flow [2025-03-13 21:57:01,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1374 transitions. [2025-03-13 21:57:01,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703389830508474 [2025-03-13 21:57:01,912 INFO L175 Difference]: Start difference. First operand has 445 places, 449 transitions, 926 flow. Second operand 3 states and 1374 transitions. [2025-03-13 21:57:01,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 456 transitions, 981 flow [2025-03-13 21:57:01,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 456 transitions, 973 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:01,920 INFO L231 Difference]: Finished difference. Result has 447 places, 452 transitions, 948 flow [2025-03-13 21:57:01,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=948, PETRI_PLACES=447, PETRI_TRANSITIONS=452} [2025-03-13 21:57:01,922 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -12 predicate places. [2025-03-13 21:57:01,922 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 452 transitions, 948 flow [2025-03-13 21:57:01,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:01,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:01,923 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:01,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:57:01,924 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:01,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:01,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1675236772, now seen corresponding path program 1 times [2025-03-13 21:57:01,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:01,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836881116] [2025-03-13 21:57:01,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:01,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:01,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-13 21:57:01,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-13 21:57:01,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:01,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:02,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:57:02,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:02,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836881116] [2025-03-13 21:57:02,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836881116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:02,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:02,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:57:02,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859520702] [2025-03-13 21:57:02,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:02,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:02,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:02,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:02,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:02,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 472 [2025-03-13 21:57:02,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 452 transitions, 948 flow. Second operand has 3 states, 3 states have (on average 454.6666666666667) internal successors, (1364), 3 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:02,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:02,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 472 [2025-03-13 21:57:02,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:02,202 INFO L124 PetriNetUnfolderBase]: 82/2173 cut-off events. [2025-03-13 21:57:02,202 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-13 21:57:02,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2361 conditions, 2173 events. 82/2173 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 12317 event pairs, 35 based on Foata normal form. 7/1964 useless extension candidates. Maximal degree in co-relation 1929. Up to 102 conditions per place. [2025-03-13 21:57:02,215 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 13 selfloop transitions, 2 changer transitions 0/456 dead transitions. [2025-03-13 21:57:02,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 456 transitions, 988 flow [2025-03-13 21:57:02,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:02,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1375 transitions. [2025-03-13 21:57:02,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971045197740113 [2025-03-13 21:57:02,219 INFO L175 Difference]: Start difference. First operand has 447 places, 452 transitions, 948 flow. Second operand 3 states and 1375 transitions. [2025-03-13 21:57:02,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 456 transitions, 988 flow [2025-03-13 21:57:02,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 456 transitions, 980 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:02,225 INFO L231 Difference]: Finished difference. Result has 448 places, 453 transitions, 952 flow [2025-03-13 21:57:02,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=952, PETRI_PLACES=448, PETRI_TRANSITIONS=453} [2025-03-13 21:57:02,226 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -11 predicate places. [2025-03-13 21:57:02,226 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 453 transitions, 952 flow [2025-03-13 21:57:02,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.6666666666667) internal successors, (1364), 3 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:02,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:02,227 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:02,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:57:02,227 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:02,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:02,228 INFO L85 PathProgramCache]: Analyzing trace with hash 182214944, now seen corresponding path program 1 times [2025-03-13 21:57:02,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:02,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520319014] [2025-03-13 21:57:02,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:02,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:02,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-13 21:57:02,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-13 21:57:02,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:02,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:57:02,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:02,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520319014] [2025-03-13 21:57:02,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520319014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:02,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:02,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:57:02,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939746651] [2025-03-13 21:57:02,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:02,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:02,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:02,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:02,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:02,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 472 [2025-03-13 21:57:02,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 453 transitions, 952 flow. Second operand has 3 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:02,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:02,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 472 [2025-03-13 21:57:02,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:02,836 INFO L124 PetriNetUnfolderBase]: 136/3825 cut-off events. [2025-03-13 21:57:02,836 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-13 21:57:02,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4046 conditions, 3825 events. 136/3825 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 26285 event pairs, 40 based on Foata normal form. 9/3434 useless extension candidates. Maximal degree in co-relation 3630. Up to 113 conditions per place. [2025-03-13 21:57:02,857 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 13 selfloop transitions, 2 changer transitions 0/457 dead transitions. [2025-03-13 21:57:02,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 457 transitions, 991 flow [2025-03-13 21:57:02,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:02,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1375 transitions. [2025-03-13 21:57:02,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971045197740113 [2025-03-13 21:57:02,860 INFO L175 Difference]: Start difference. First operand has 448 places, 453 transitions, 952 flow. Second operand 3 states and 1375 transitions. [2025-03-13 21:57:02,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 457 transitions, 991 flow [2025-03-13 21:57:02,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 457 transitions, 989 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:02,868 INFO L231 Difference]: Finished difference. Result has 450 places, 454 transitions, 962 flow [2025-03-13 21:57:02,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=962, PETRI_PLACES=450, PETRI_TRANSITIONS=454} [2025-03-13 21:57:02,869 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -9 predicate places. [2025-03-13 21:57:02,869 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 454 transitions, 962 flow [2025-03-13 21:57:02,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:02,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:02,870 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:02,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:57:02,870 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:02,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:02,870 INFO L85 PathProgramCache]: Analyzing trace with hash 2048093260, now seen corresponding path program 1 times [2025-03-13 21:57:02,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:02,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447397402] [2025-03-13 21:57:02,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:02,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:02,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-13 21:57:02,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-13 21:57:02,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:02,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:03,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:57:03,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:03,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447397402] [2025-03-13 21:57:03,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447397402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:03,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:03,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:03,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878889925] [2025-03-13 21:57:03,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:03,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:03,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:03,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:03,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:04,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 472 [2025-03-13 21:57:04,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 454 transitions, 962 flow. Second operand has 6 states, 6 states have (on average 397.5) internal successors, (2385), 6 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:04,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:04,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 472 [2025-03-13 21:57:04,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:04,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1104] L1039-3-->L1039: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret74#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret74#1=|v_t2Thread1of1ForFork0_#t~ret74#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret74#1][178], [523#true, Black: 512#(= |#race~dequeue_flag~0| 0), 519#true, Black: 517#(= |t1Thread1of1ForFork1_~i~0#1| 0), Black: 521#(= 0 |t2Thread1of1ForFork0_~i~1#1|), 103#L1039true, 465#true, Black: 507#(= |#race~enqueue_flag~0| 0), 333#L1020true, 375#L1053-1true]) [2025-03-13 21:57:04,812 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-03-13 21:57:04,812 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-03-13 21:57:04,812 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-13 21:57:04,812 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-03-13 21:57:04,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1104] L1039-3-->L1039: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret74#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret74#1=|v_t2Thread1of1ForFork0_#t~ret74#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret74#1][178], [523#true, Black: 512#(= |#race~dequeue_flag~0| 0), 519#true, Black: 517#(= |t1Thread1of1ForFork1_~i~0#1| 0), Black: 521#(= 0 |t2Thread1of1ForFork0_~i~1#1|), 103#L1039true, 465#true, Black: 507#(= |#race~enqueue_flag~0| 0), 204#L1055true]) [2025-03-13 21:57:04,812 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2025-03-13 21:57:04,812 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2025-03-13 21:57:04,812 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-13 21:57:04,812 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2025-03-13 21:57:07,165 INFO L124 PetriNetUnfolderBase]: 3991/24250 cut-off events. [2025-03-13 21:57:07,165 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-13 21:57:07,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32098 conditions, 24250 events. 3991/24250 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 282487 event pairs, 1492 based on Foata normal form. 0/21673 useless extension candidates. Maximal degree in co-relation 31316. Up to 5596 conditions per place. [2025-03-13 21:57:07,240 INFO L140 encePairwiseOnDemand]: 439/472 looper letters, 83 selfloop transitions, 66 changer transitions 0/533 dead transitions. [2025-03-13 21:57:07,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 533 transitions, 1426 flow [2025-03-13 21:57:07,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:07,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:07,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2516 transitions. [2025-03-13 21:57:07,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8884180790960452 [2025-03-13 21:57:07,245 INFO L175 Difference]: Start difference. First operand has 450 places, 454 transitions, 962 flow. Second operand 6 states and 2516 transitions. [2025-03-13 21:57:07,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 533 transitions, 1426 flow [2025-03-13 21:57:07,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 533 transitions, 1424 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:07,253 INFO L231 Difference]: Finished difference. Result has 459 places, 518 transitions, 1414 flow [2025-03-13 21:57:07,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1414, PETRI_PLACES=459, PETRI_TRANSITIONS=518} [2025-03-13 21:57:07,255 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 0 predicate places. [2025-03-13 21:57:07,255 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 518 transitions, 1414 flow [2025-03-13 21:57:07,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 397.5) internal successors, (2385), 6 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:07,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:07,257 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:07,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:57:07,257 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:07,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:07,259 INFO L85 PathProgramCache]: Analyzing trace with hash 356132486, now seen corresponding path program 1 times [2025-03-13 21:57:07,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:07,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44653885] [2025-03-13 21:57:07,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:07,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:07,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-13 21:57:07,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-13 21:57:07,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:07,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:57:07,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:07,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44653885] [2025-03-13 21:57:07,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44653885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:07,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:07,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:57:07,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013303220] [2025-03-13 21:57:07,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:07,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:07,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:07,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:07,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:07,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 472 [2025-03-13 21:57:07,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 518 transitions, 1414 flow. Second operand has 3 states, 3 states have (on average 454.0) internal successors, (1362), 3 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:07,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:07,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 472 [2025-03-13 21:57:07,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:07,660 INFO L124 PetriNetUnfolderBase]: 86/2843 cut-off events. [2025-03-13 21:57:07,660 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-13 21:57:07,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3390 conditions, 2843 events. 86/2843 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 17270 event pairs, 17 based on Foata normal form. 4/2583 useless extension candidates. Maximal degree in co-relation 2911. Up to 169 conditions per place. [2025-03-13 21:57:07,671 INFO L140 encePairwiseOnDemand]: 468/472 looper letters, 14 selfloop transitions, 3 changer transitions 0/452 dead transitions. [2025-03-13 21:57:07,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 452 transitions, 1067 flow [2025-03-13 21:57:07,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:07,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:07,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1374 transitions. [2025-03-13 21:57:07,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703389830508474 [2025-03-13 21:57:07,673 INFO L175 Difference]: Start difference. First operand has 459 places, 518 transitions, 1414 flow. Second operand 3 states and 1374 transitions. [2025-03-13 21:57:07,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 452 transitions, 1067 flow [2025-03-13 21:57:07,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 452 transitions, 977 flow, removed 21 selfloop flow, removed 12 redundant places. [2025-03-13 21:57:07,681 INFO L231 Difference]: Finished difference. Result has 446 places, 447 transitions, 941 flow [2025-03-13 21:57:07,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=941, PETRI_PLACES=446, PETRI_TRANSITIONS=447} [2025-03-13 21:57:07,683 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -13 predicate places. [2025-03-13 21:57:07,683 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 447 transitions, 941 flow [2025-03-13 21:57:07,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.0) internal successors, (1362), 3 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:07,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:07,684 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:07,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 21:57:07,684 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:07,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:07,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1178204073, now seen corresponding path program 1 times [2025-03-13 21:57:07,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:07,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355624088] [2025-03-13 21:57:07,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:07,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:07,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-13 21:57:07,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-13 21:57:07,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:07,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:08,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:57:08,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:08,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355624088] [2025-03-13 21:57:08,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355624088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:08,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:08,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:08,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428826717] [2025-03-13 21:57:08,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:08,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:08,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:08,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:08,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:08,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 472 [2025-03-13 21:57:08,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 447 transitions, 941 flow. Second operand has 6 states, 6 states have (on average 353.8333333333333) internal successors, (2123), 6 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:08,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:08,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 472 [2025-03-13 21:57:08,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:08,822 INFO L124 PetriNetUnfolderBase]: 693/3437 cut-off events. [2025-03-13 21:57:08,823 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2025-03-13 21:57:08,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5268 conditions, 3437 events. 693/3437 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 23994 event pairs, 604 based on Foata normal form. 0/3174 useless extension candidates. Maximal degree in co-relation 4400. Up to 1497 conditions per place. [2025-03-13 21:57:08,835 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 122 selfloop transitions, 5 changer transitions 0/458 dead transitions. [2025-03-13 21:57:08,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 458 transitions, 1225 flow [2025-03-13 21:57:08,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:08,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2216 transitions. [2025-03-13 21:57:08,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7824858757062146 [2025-03-13 21:57:08,838 INFO L175 Difference]: Start difference. First operand has 446 places, 447 transitions, 941 flow. Second operand 6 states and 2216 transitions. [2025-03-13 21:57:08,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 458 transitions, 1225 flow [2025-03-13 21:57:08,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 458 transitions, 1219 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:08,845 INFO L231 Difference]: Finished difference. Result has 448 places, 446 transitions, 943 flow [2025-03-13 21:57:08,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=943, PETRI_PLACES=448, PETRI_TRANSITIONS=446} [2025-03-13 21:57:08,846 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -11 predicate places. [2025-03-13 21:57:08,846 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 446 transitions, 943 flow [2025-03-13 21:57:08,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 353.8333333333333) internal successors, (2123), 6 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:08,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:08,848 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:08,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 21:57:08,848 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:08,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:08,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1063033939, now seen corresponding path program 1 times [2025-03-13 21:57:08,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:08,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518937075] [2025-03-13 21:57:08,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:08,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:08,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-13 21:57:08,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-13 21:57:08,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:08,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:57:09,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:09,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518937075] [2025-03-13 21:57:09,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518937075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:09,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:09,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:09,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057309841] [2025-03-13 21:57:09,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:09,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:09,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:09,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:09,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:09,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 472 [2025-03-13 21:57:09,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 446 transitions, 943 flow. Second operand has 6 states, 6 states have (on average 415.1666666666667) internal successors, (2491), 6 states have internal predecessors, (2491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:09,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:09,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 472 [2025-03-13 21:57:09,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:10,189 INFO L124 PetriNetUnfolderBase]: 297/2792 cut-off events. [2025-03-13 21:57:10,189 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-13 21:57:10,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3596 conditions, 2792 events. 297/2792 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 16355 event pairs, 214 based on Foata normal form. 0/2562 useless extension candidates. Maximal degree in co-relation 2960. Up to 533 conditions per place. [2025-03-13 21:57:10,198 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 59 selfloop transitions, 5 changer transitions 0/457 dead transitions. [2025-03-13 21:57:10,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 457 transitions, 1101 flow [2025-03-13 21:57:10,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:10,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2531 transitions. [2025-03-13 21:57:10,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8937146892655368 [2025-03-13 21:57:10,202 INFO L175 Difference]: Start difference. First operand has 448 places, 446 transitions, 943 flow. Second operand 6 states and 2531 transitions. [2025-03-13 21:57:10,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 457 transitions, 1101 flow [2025-03-13 21:57:10,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 457 transitions, 1091 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:10,207 INFO L231 Difference]: Finished difference. Result has 447 places, 445 transitions, 941 flow [2025-03-13 21:57:10,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=941, PETRI_PLACES=447, PETRI_TRANSITIONS=445} [2025-03-13 21:57:10,208 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -12 predicate places. [2025-03-13 21:57:10,208 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 445 transitions, 941 flow [2025-03-13 21:57:10,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 415.1666666666667) internal successors, (2491), 6 states have internal predecessors, (2491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:10,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:10,209 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:10,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 21:57:10,209 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:10,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:10,210 INFO L85 PathProgramCache]: Analyzing trace with hash -2066489295, now seen corresponding path program 1 times [2025-03-13 21:57:10,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:10,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492463909] [2025-03-13 21:57:10,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:10,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:10,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-13 21:57:10,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-13 21:57:10,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:10,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:10,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:57:10,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:10,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492463909] [2025-03-13 21:57:10,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492463909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:10,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:10,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:10,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121507650] [2025-03-13 21:57:10,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:10,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:10,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:10,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:10,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:10,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 472 [2025-03-13 21:57:10,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 445 transitions, 941 flow. Second operand has 6 states, 6 states have (on average 375.5) internal successors, (2253), 6 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:10,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:10,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 472 [2025-03-13 21:57:10,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:11,287 INFO L124 PetriNetUnfolderBase]: 567/3295 cut-off events. [2025-03-13 21:57:11,287 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2025-03-13 21:57:11,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4777 conditions, 3295 events. 567/3295 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22641 event pairs, 478 based on Foata normal form. 0/3048 useless extension candidates. Maximal degree in co-relation 4115. Up to 1203 conditions per place. [2025-03-13 21:57:11,295 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 101 selfloop transitions, 5 changer transitions 0/456 dead transitions. [2025-03-13 21:57:11,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 456 transitions, 1183 flow [2025-03-13 21:57:11,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2321 transitions. [2025-03-13 21:57:11,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8195621468926554 [2025-03-13 21:57:11,298 INFO L175 Difference]: Start difference. First operand has 447 places, 445 transitions, 941 flow. Second operand 6 states and 2321 transitions. [2025-03-13 21:57:11,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 456 transitions, 1183 flow [2025-03-13 21:57:11,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 456 transitions, 1173 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:11,303 INFO L231 Difference]: Finished difference. Result has 446 places, 444 transitions, 939 flow [2025-03-13 21:57:11,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=939, PETRI_PLACES=446, PETRI_TRANSITIONS=444} [2025-03-13 21:57:11,303 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -13 predicate places. [2025-03-13 21:57:11,304 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 444 transitions, 939 flow [2025-03-13 21:57:11,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 375.5) internal successors, (2253), 6 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:11,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:11,305 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:11,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 21:57:11,305 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:11,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:11,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1821259648, now seen corresponding path program 1 times [2025-03-13 21:57:11,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:11,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719183812] [2025-03-13 21:57:11,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:11,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:11,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-13 21:57:11,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-13 21:57:11,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:11,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:11,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:57:11,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:11,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719183812] [2025-03-13 21:57:11,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719183812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:11,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:11,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:11,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284978875] [2025-03-13 21:57:11,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:11,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:11,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:11,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:11,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:12,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 472 [2025-03-13 21:57:12,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 444 transitions, 939 flow. Second operand has 6 states, 6 states have (on average 361.3333333333333) internal successors, (2168), 6 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:12,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:12,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 472 [2025-03-13 21:57:12,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:12,624 INFO L124 PetriNetUnfolderBase]: 657/3377 cut-off events. [2025-03-13 21:57:12,624 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2025-03-13 21:57:12,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5129 conditions, 3377 events. 657/3377 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 23392 event pairs, 568 based on Foata normal form. 0/3146 useless extension candidates. Maximal degree in co-relation 4319. Up to 1413 conditions per place. [2025-03-13 21:57:12,634 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 116 selfloop transitions, 5 changer transitions 0/455 dead transitions. [2025-03-13 21:57:12,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 455 transitions, 1211 flow [2025-03-13 21:57:12,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:12,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:12,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2246 transitions. [2025-03-13 21:57:12,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7930790960451978 [2025-03-13 21:57:12,637 INFO L175 Difference]: Start difference. First operand has 446 places, 444 transitions, 939 flow. Second operand 6 states and 2246 transitions. [2025-03-13 21:57:12,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 455 transitions, 1211 flow [2025-03-13 21:57:12,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 455 transitions, 1201 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:12,642 INFO L231 Difference]: Finished difference. Result has 445 places, 443 transitions, 937 flow [2025-03-13 21:57:12,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=937, PETRI_PLACES=445, PETRI_TRANSITIONS=443} [2025-03-13 21:57:12,643 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -14 predicate places. [2025-03-13 21:57:12,643 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 443 transitions, 937 flow [2025-03-13 21:57:12,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 361.3333333333333) internal successors, (2168), 6 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:12,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:12,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:12,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 21:57:12,644 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:12,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:12,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1293842287, now seen corresponding path program 1 times [2025-03-13 21:57:12,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:12,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850712340] [2025-03-13 21:57:12,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:12,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:12,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-13 21:57:12,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-13 21:57:12,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:12,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:12,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-13 21:57:12,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:12,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850712340] [2025-03-13 21:57:12,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850712340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:12,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:12,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:12,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618970656] [2025-03-13 21:57:12,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:12,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:12,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:12,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:12,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:13,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 472 [2025-03-13 21:57:13,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 443 transitions, 937 flow. Second operand has 6 states, 6 states have (on average 362.1666666666667) internal successors, (2173), 6 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:13,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:13,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 472 [2025-03-13 21:57:13,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:13,697 INFO L124 PetriNetUnfolderBase]: 651/3363 cut-off events. [2025-03-13 21:57:13,697 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2025-03-13 21:57:13,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5105 conditions, 3363 events. 651/3363 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 23230 event pairs, 562 based on Foata normal form. 0/3132 useless extension candidates. Maximal degree in co-relation 4305. Up to 1407 conditions per place. [2025-03-13 21:57:13,707 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 116 selfloop transitions, 5 changer transitions 0/454 dead transitions. [2025-03-13 21:57:13,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 454 transitions, 1209 flow [2025-03-13 21:57:13,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:13,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2246 transitions. [2025-03-13 21:57:13,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7930790960451978 [2025-03-13 21:57:13,710 INFO L175 Difference]: Start difference. First operand has 445 places, 443 transitions, 937 flow. Second operand 6 states and 2246 transitions. [2025-03-13 21:57:13,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 454 transitions, 1209 flow [2025-03-13 21:57:13,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 454 transitions, 1199 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:13,715 INFO L231 Difference]: Finished difference. Result has 444 places, 442 transitions, 935 flow [2025-03-13 21:57:13,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=935, PETRI_PLACES=444, PETRI_TRANSITIONS=442} [2025-03-13 21:57:13,717 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -15 predicate places. [2025-03-13 21:57:13,717 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 442 transitions, 935 flow [2025-03-13 21:57:13,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 362.1666666666667) internal successors, (2173), 6 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:13,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:13,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:13,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 21:57:13,718 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:13,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:13,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1910331373, now seen corresponding path program 1 times [2025-03-13 21:57:13,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:13,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868367791] [2025-03-13 21:57:13,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:13,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:13,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-13 21:57:13,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-13 21:57:13,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:13,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-13 21:57:14,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:14,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868367791] [2025-03-13 21:57:14,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868367791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:14,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:14,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:14,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671197864] [2025-03-13 21:57:14,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:14,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:14,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:14,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:14,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:14,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 472 [2025-03-13 21:57:14,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 442 transitions, 935 flow. Second operand has 6 states, 6 states have (on average 358.1666666666667) internal successors, (2149), 6 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:14,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:14,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 472 [2025-03-13 21:57:14,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:14,675 INFO L124 PetriNetUnfolderBase]: 672/3379 cut-off events. [2025-03-13 21:57:14,675 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-03-13 21:57:14,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5181 conditions, 3379 events. 672/3379 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 23483 event pairs, 583 based on Foata normal form. 0/3154 useless extension candidates. Maximal degree in co-relation 4974. Up to 1453 conditions per place. [2025-03-13 21:57:14,684 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 122 selfloop transitions, 5 changer transitions 0/453 dead transitions. [2025-03-13 21:57:14,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 453 transitions, 1219 flow [2025-03-13 21:57:14,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:14,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2221 transitions. [2025-03-13 21:57:14,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7842514124293786 [2025-03-13 21:57:14,687 INFO L175 Difference]: Start difference. First operand has 444 places, 442 transitions, 935 flow. Second operand 6 states and 2221 transitions. [2025-03-13 21:57:14,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 453 transitions, 1219 flow [2025-03-13 21:57:14,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 453 transitions, 1209 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:14,692 INFO L231 Difference]: Finished difference. Result has 443 places, 441 transitions, 933 flow [2025-03-13 21:57:14,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=933, PETRI_PLACES=443, PETRI_TRANSITIONS=441} [2025-03-13 21:57:14,693 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -16 predicate places. [2025-03-13 21:57:14,693 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 441 transitions, 933 flow [2025-03-13 21:57:14,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 358.1666666666667) internal successors, (2149), 6 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:14,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:14,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:14,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 21:57:14,694 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:14,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:14,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1499016472, now seen corresponding path program 1 times [2025-03-13 21:57:14,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:14,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117256101] [2025-03-13 21:57:14,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:14,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:14,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-13 21:57:14,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-13 21:57:14,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:14,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-13 21:57:14,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:14,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117256101] [2025-03-13 21:57:14,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117256101] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:57:14,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786522625] [2025-03-13 21:57:14,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:14,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:14,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:57:14,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:57:14,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:57:14,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-13 21:57:15,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-13 21:57:15,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:15,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:15,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:57:15,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:57:15,055 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-13 21:57:15,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:57:15,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786522625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:15,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:57:15,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-13 21:57:15,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622904678] [2025-03-13 21:57:15,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:15,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:15,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:15,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:15,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:15,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 472 [2025-03-13 21:57:15,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 441 transitions, 933 flow. Second operand has 3 states, 3 states have (on average 451.3333333333333) internal successors, (1354), 3 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:15,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:15,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 472 [2025-03-13 21:57:15,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:15,240 INFO L124 PetriNetUnfolderBase]: 64/1688 cut-off events. [2025-03-13 21:57:15,240 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-13 21:57:15,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1892 conditions, 1688 events. 64/1688 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 7490 event pairs, 29 based on Foata normal form. 0/1598 useless extension candidates. Maximal degree in co-relation 1461. Up to 79 conditions per place. [2025-03-13 21:57:15,245 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 15 selfloop transitions, 2 changer transitions 0/443 dead transitions. [2025-03-13 21:57:15,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 443 transitions, 973 flow [2025-03-13 21:57:15,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:15,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1365 transitions. [2025-03-13 21:57:15,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9639830508474576 [2025-03-13 21:57:15,247 INFO L175 Difference]: Start difference. First operand has 443 places, 441 transitions, 933 flow. Second operand 3 states and 1365 transitions. [2025-03-13 21:57:15,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 443 transitions, 973 flow [2025-03-13 21:57:15,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 443 transitions, 963 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:15,253 INFO L231 Difference]: Finished difference. Result has 439 places, 440 transitions, 925 flow [2025-03-13 21:57:15,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=925, PETRI_PLACES=439, PETRI_TRANSITIONS=440} [2025-03-13 21:57:15,253 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -20 predicate places. [2025-03-13 21:57:15,253 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 440 transitions, 925 flow [2025-03-13 21:57:15,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 451.3333333333333) internal successors, (1354), 3 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:15,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:15,254 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:15,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 21:57:15,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:15,458 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:15,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:15,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1387476388, now seen corresponding path program 1 times [2025-03-13 21:57:15,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:15,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893006149] [2025-03-13 21:57:15,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:15,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:15,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-13 21:57:15,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-13 21:57:15,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:15,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-13 21:57:15,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:15,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893006149] [2025-03-13 21:57:15,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893006149] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:57:15,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163106176] [2025-03-13 21:57:15,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:15,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:15,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:57:15,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:57:15,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:57:15,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-13 21:57:15,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-13 21:57:15,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:15,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:15,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:57:15,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:57:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-13 21:57:15,864 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:57:15,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163106176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:15,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:57:15,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-13 21:57:15,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616683243] [2025-03-13 21:57:15,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:15,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:15,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:15,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:15,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:15,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 472 [2025-03-13 21:57:15,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 440 transitions, 925 flow. Second operand has 3 states, 3 states have (on average 451.0) internal successors, (1353), 3 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:15,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:15,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 472 [2025-03-13 21:57:15,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:16,264 INFO L124 PetriNetUnfolderBase]: 136/3370 cut-off events. [2025-03-13 21:57:16,264 INFO L125 PetriNetUnfolderBase]: For 41/48 co-relation queries the response was YES. [2025-03-13 21:57:16,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 3370 events. 136/3370 cut-off events. For 41/48 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 22195 event pairs, 38 based on Foata normal form. 1/3116 useless extension candidates. Maximal degree in co-relation 3252. Up to 129 conditions per place. [2025-03-13 21:57:16,275 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 17 selfloop transitions, 7 changer transitions 1/448 dead transitions. [2025-03-13 21:57:16,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 448 transitions, 999 flow [2025-03-13 21:57:16,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:16,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:16,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1370 transitions. [2025-03-13 21:57:16,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675141242937854 [2025-03-13 21:57:16,278 INFO L175 Difference]: Start difference. First operand has 439 places, 440 transitions, 925 flow. Second operand 3 states and 1370 transitions. [2025-03-13 21:57:16,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 448 transitions, 999 flow [2025-03-13 21:57:16,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 448 transitions, 995 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:16,283 INFO L231 Difference]: Finished difference. Result has 441 places, 445 transitions, 977 flow [2025-03-13 21:57:16,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=977, PETRI_PLACES=441, PETRI_TRANSITIONS=445} [2025-03-13 21:57:16,284 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -18 predicate places. [2025-03-13 21:57:16,284 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 445 transitions, 977 flow [2025-03-13 21:57:16,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 451.0) internal successors, (1353), 3 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:16,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:16,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:16,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 21:57:16,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-13 21:57:16,485 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:16,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:16,486 INFO L85 PathProgramCache]: Analyzing trace with hash 834769128, now seen corresponding path program 1 times [2025-03-13 21:57:16,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:16,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054353915] [2025-03-13 21:57:16,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:16,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:16,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-13 21:57:16,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-13 21:57:16,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:16,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-13 21:57:16,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:16,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054353915] [2025-03-13 21:57:16,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054353915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:57:16,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365318838] [2025-03-13 21:57:16,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:16,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:16,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:57:16,628 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:57:16,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:57:16,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-13 21:57:16,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-13 21:57:16,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:16,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:16,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:57:16,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:57:16,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-13 21:57:16,887 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-13 21:57:16,887 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:57:16,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365318838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:16,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:57:16,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-13 21:57:16,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820829965] [2025-03-13 21:57:16,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:16,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:16,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:16,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:16,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:16,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 472 [2025-03-13 21:57:16,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 445 transitions, 977 flow. Second operand has 3 states, 3 states have (on average 457.0) internal successors, (1371), 3 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:16,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:16,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 472 [2025-03-13 21:57:16,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:17,029 INFO L124 PetriNetUnfolderBase]: 33/1428 cut-off events. [2025-03-13 21:57:17,030 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 21:57:17,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1543 conditions, 1428 events. 33/1428 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 5282 event pairs, 6 based on Foata normal form. 2/1356 useless extension candidates. Maximal degree in co-relation 1141. Up to 26 conditions per place. [2025-03-13 21:57:17,033 INFO L140 encePairwiseOnDemand]: 468/472 looper letters, 7 selfloop transitions, 3 changer transitions 5/438 dead transitions. [2025-03-13 21:57:17,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 438 transitions, 954 flow [2025-03-13 21:57:17,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1378 transitions. [2025-03-13 21:57:17,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9731638418079096 [2025-03-13 21:57:17,035 INFO L175 Difference]: Start difference. First operand has 441 places, 445 transitions, 977 flow. Second operand 3 states and 1378 transitions. [2025-03-13 21:57:17,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 438 transitions, 954 flow [2025-03-13 21:57:17,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 438 transitions, 934 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-13 21:57:17,039 INFO L231 Difference]: Finished difference. Result has 437 places, 431 transitions, 899 flow [2025-03-13 21:57:17,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=437, PETRI_TRANSITIONS=431} [2025-03-13 21:57:17,040 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -22 predicate places. [2025-03-13 21:57:17,040 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 431 transitions, 899 flow [2025-03-13 21:57:17,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 457.0) internal successors, (1371), 3 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:17,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:17,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:17,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-13 21:57:17,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:17,241 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:17,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:17,242 INFO L85 PathProgramCache]: Analyzing trace with hash -229473674, now seen corresponding path program 1 times [2025-03-13 21:57:17,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:17,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802768257] [2025-03-13 21:57:17,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:17,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:17,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-13 21:57:17,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-13 21:57:17,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:17,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:17,348 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-13 21:57:17,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:17,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802768257] [2025-03-13 21:57:17,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802768257] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:57:17,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339960885] [2025-03-13 21:57:17,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:17,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:17,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:57:17,351 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:57:17,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:57:17,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-13 21:57:17,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-13 21:57:17,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:17,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:17,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:57:17,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:57:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-13 21:57:17,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:57:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-13 21:57:17,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339960885] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:57:17,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:57:17,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 21:57:17,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421163229] [2025-03-13 21:57:17,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:57:17,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:57:17,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:17,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:57:17,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:57:17,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 472 [2025-03-13 21:57:17,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 431 transitions, 899 flow. Second operand has 10 states, 10 states have (on average 452.2) internal successors, (4522), 10 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:17,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:17,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 472 [2025-03-13 21:57:17,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:17,973 INFO L124 PetriNetUnfolderBase]: 44/1399 cut-off events. [2025-03-13 21:57:17,973 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-13 21:57:17,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1557 conditions, 1399 events. 44/1399 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3399 event pairs, 10 based on Foata normal form. 4/1326 useless extension candidates. Maximal degree in co-relation 986. Up to 35 conditions per place. [2025-03-13 21:57:17,976 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 20 selfloop transitions, 9 changer transitions 0/446 dead transitions. [2025-03-13 21:57:17,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 446 transitions, 1003 flow [2025-03-13 21:57:17,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:57:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:57:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4081 transitions. [2025-03-13 21:57:17,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9606873822975518 [2025-03-13 21:57:17,978 INFO L175 Difference]: Start difference. First operand has 437 places, 431 transitions, 899 flow. Second operand 9 states and 4081 transitions. [2025-03-13 21:57:17,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 446 transitions, 1003 flow [2025-03-13 21:57:17,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 446 transitions, 994 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-13 21:57:17,982 INFO L231 Difference]: Finished difference. Result has 441 places, 437 transitions, 940 flow [2025-03-13 21:57:17,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=940, PETRI_PLACES=441, PETRI_TRANSITIONS=437} [2025-03-13 21:57:17,983 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -18 predicate places. [2025-03-13 21:57:17,983 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 437 transitions, 940 flow [2025-03-13 21:57:17,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 452.2) internal successors, (4522), 10 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:17,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:17,984 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:17,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 21:57:18,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:18,185 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:18,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:18,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1469125228, now seen corresponding path program 2 times [2025-03-13 21:57:18,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:18,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573585908] [2025-03-13 21:57:18,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:57:18,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:18,225 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 407 statements into 2 equivalence classes. [2025-03-13 21:57:18,231 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 176 of 407 statements. [2025-03-13 21:57:18,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:57:18,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:18,457 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-03-13 21:57:18,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:18,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573585908] [2025-03-13 21:57:18,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573585908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:18,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:18,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:18,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952637110] [2025-03-13 21:57:18,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:18,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:18,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:18,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:18,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:18,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 472 [2025-03-13 21:57:18,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 437 transitions, 940 flow. Second operand has 6 states, 6 states have (on average 410.6666666666667) internal successors, (2464), 6 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:18,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:18,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 472 [2025-03-13 21:57:18,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:19,091 INFO L124 PetriNetUnfolderBase]: 130/1477 cut-off events. [2025-03-13 21:57:19,092 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-13 21:57:19,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2013 conditions, 1477 events. 130/1477 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 4521 event pairs, 95 based on Foata normal form. 0/1405 useless extension candidates. Maximal degree in co-relation 1266. Up to 303 conditions per place. [2025-03-13 21:57:19,095 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 57 selfloop transitions, 5 changer transitions 0/440 dead transitions. [2025-03-13 21:57:19,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 440 transitions, 1074 flow [2025-03-13 21:57:19,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2487 transitions. [2025-03-13 21:57:19,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.878177966101695 [2025-03-13 21:57:19,098 INFO L175 Difference]: Start difference. First operand has 441 places, 437 transitions, 940 flow. Second operand 6 states and 2487 transitions. [2025-03-13 21:57:19,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 440 transitions, 1074 flow [2025-03-13 21:57:19,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 440 transitions, 1068 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:19,102 INFO L231 Difference]: Finished difference. Result has 444 places, 436 transitions, 942 flow [2025-03-13 21:57:19,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=942, PETRI_PLACES=444, PETRI_TRANSITIONS=436} [2025-03-13 21:57:19,103 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -15 predicate places. [2025-03-13 21:57:19,103 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 436 transitions, 942 flow [2025-03-13 21:57:19,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 410.6666666666667) internal successors, (2464), 6 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:19,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:19,104 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:19,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 21:57:19,104 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:19,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:19,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1950634249, now seen corresponding path program 1 times [2025-03-13 21:57:19,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:19,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274398568] [2025-03-13 21:57:19,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:19,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:19,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-13 21:57:19,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-13 21:57:19,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:19,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-13 21:57:19,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:19,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274398568] [2025-03-13 21:57:19,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274398568] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:57:19,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580712927] [2025-03-13 21:57:19,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:19,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:19,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:57:19,389 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:57:19,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 21:57:19,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-13 21:57:19,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-13 21:57:19,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:19,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:19,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:57:19,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:57:19,855 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-13 21:57:19,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:57:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-13 21:57:20,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580712927] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:57:20,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:57:20,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-13 21:57:20,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726331251] [2025-03-13 21:57:20,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:57:20,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-13 21:57:20,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:20,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-13 21:57:20,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-13 21:57:20,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 472 [2025-03-13 21:57:20,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 436 transitions, 942 flow. Second operand has 18 states, 18 states have (on average 452.1111111111111) internal successors, (8138), 18 states have internal predecessors, (8138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:20,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:20,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 472 [2025-03-13 21:57:20,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:20,629 INFO L124 PetriNetUnfolderBase]: 70/2163 cut-off events. [2025-03-13 21:57:20,630 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-13 21:57:20,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2489 conditions, 2163 events. 70/2163 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4837 event pairs, 10 based on Foata normal form. 8/2090 useless extension candidates. Maximal degree in co-relation 1897. Up to 35 conditions per place. [2025-03-13 21:57:20,635 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 36 selfloop transitions, 21 changer transitions 0/473 dead transitions. [2025-03-13 21:57:20,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 473 transitions, 1220 flow [2025-03-13 21:57:20,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 21:57:20,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 21:57:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 9511 transitions. [2025-03-13 21:57:20,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95954398708636 [2025-03-13 21:57:20,641 INFO L175 Difference]: Start difference. First operand has 444 places, 436 transitions, 942 flow. Second operand 21 states and 9511 transitions. [2025-03-13 21:57:20,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 473 transitions, 1220 flow [2025-03-13 21:57:20,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 473 transitions, 1210 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:20,648 INFO L231 Difference]: Finished difference. Result has 464 places, 449 transitions, 1062 flow [2025-03-13 21:57:20,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1062, PETRI_PLACES=464, PETRI_TRANSITIONS=449} [2025-03-13 21:57:20,648 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 5 predicate places. [2025-03-13 21:57:20,649 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 449 transitions, 1062 flow [2025-03-13 21:57:20,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 452.1111111111111) internal successors, (8138), 18 states have internal predecessors, (8138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:20,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:20,651 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:20,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-13 21:57:20,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-13 21:57:20,852 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:20,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:20,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1071825591, now seen corresponding path program 2 times [2025-03-13 21:57:20,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:20,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850391969] [2025-03-13 21:57:20,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:57:20,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:20,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 713 statements into 2 equivalence classes. [2025-03-13 21:57:20,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 182 of 713 statements. [2025-03-13 21:57:20,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:57:20,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2612 trivial. 0 not checked. [2025-03-13 21:57:21,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:21,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850391969] [2025-03-13 21:57:21,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850391969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:21,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:21,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:21,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791578978] [2025-03-13 21:57:21,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:21,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:21,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:21,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:21,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:21,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 472 [2025-03-13 21:57:21,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 449 transitions, 1062 flow. Second operand has 6 states, 6 states have (on average 410.6666666666667) internal successors, (2464), 6 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:21,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:21,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 472 [2025-03-13 21:57:21,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:21,993 INFO L124 PetriNetUnfolderBase]: 218/2305 cut-off events. [2025-03-13 21:57:21,993 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-03-13 21:57:21,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3362 conditions, 2305 events. 218/2305 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 6855 event pairs, 175 based on Foata normal form. 0/2229 useless extension candidates. Maximal degree in co-relation 2614. Up to 543 conditions per place. [2025-03-13 21:57:21,999 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 57 selfloop transitions, 5 changer transitions 0/452 dead transitions. [2025-03-13 21:57:22,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 452 transitions, 1196 flow [2025-03-13 21:57:22,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:22,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2487 transitions. [2025-03-13 21:57:22,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.878177966101695 [2025-03-13 21:57:22,002 INFO L175 Difference]: Start difference. First operand has 464 places, 449 transitions, 1062 flow. Second operand 6 states and 2487 transitions. [2025-03-13 21:57:22,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 452 transitions, 1196 flow [2025-03-13 21:57:22,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 452 transitions, 1172 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-13 21:57:22,007 INFO L231 Difference]: Finished difference. Result has 462 places, 448 transitions, 1046 flow [2025-03-13 21:57:22,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1046, PETRI_PLACES=462, PETRI_TRANSITIONS=448} [2025-03-13 21:57:22,008 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 3 predicate places. [2025-03-13 21:57:22,008 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 448 transitions, 1046 flow [2025-03-13 21:57:22,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 410.6666666666667) internal successors, (2464), 6 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:22,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:22,009 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:22,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-13 21:57:22,009 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:22,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:22,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1315803186, now seen corresponding path program 1 times [2025-03-13 21:57:22,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:22,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062131417] [2025-03-13 21:57:22,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:22,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:22,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-03-13 21:57:22,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-03-13 21:57:22,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:22,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2612 trivial. 0 not checked. [2025-03-13 21:57:22,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:22,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062131417] [2025-03-13 21:57:22,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062131417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:22,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:22,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:57:22,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650838000] [2025-03-13 21:57:22,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:22,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:57:22,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:22,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:57:22,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:57:22,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 472 [2025-03-13 21:57:22,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 448 transitions, 1046 flow. Second operand has 4 states, 4 states have (on average 452.5) internal successors, (1810), 4 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:22,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:22,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 472 [2025-03-13 21:57:22,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:22,663 INFO L124 PetriNetUnfolderBase]: 60/2597 cut-off events. [2025-03-13 21:57:22,663 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-03-13 21:57:22,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2885 conditions, 2597 events. 60/2597 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 8023 event pairs, 17 based on Foata normal form. 4/2481 useless extension candidates. Maximal degree in co-relation 1943. Up to 59 conditions per place. [2025-03-13 21:57:22,669 INFO L140 encePairwiseOnDemand]: 467/472 looper letters, 14 selfloop transitions, 4 changer transitions 0/453 dead transitions. [2025-03-13 21:57:22,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 453 transitions, 1094 flow [2025-03-13 21:57:22,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:57:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:57:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1819 transitions. [2025-03-13 21:57:22,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9634533898305084 [2025-03-13 21:57:22,671 INFO L175 Difference]: Start difference. First operand has 462 places, 448 transitions, 1046 flow. Second operand 4 states and 1819 transitions. [2025-03-13 21:57:22,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 453 transitions, 1094 flow [2025-03-13 21:57:22,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 453 transitions, 1084 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:22,677 INFO L231 Difference]: Finished difference. Result has 462 places, 451 transitions, 1064 flow [2025-03-13 21:57:22,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1064, PETRI_PLACES=462, PETRI_TRANSITIONS=451} [2025-03-13 21:57:22,678 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 3 predicate places. [2025-03-13 21:57:22,678 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 451 transitions, 1064 flow [2025-03-13 21:57:22,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 452.5) internal successors, (1810), 4 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:22,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:22,679 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:22,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-13 21:57:22,679 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:22,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:22,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2001715536, now seen corresponding path program 1 times [2025-03-13 21:57:22,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:22,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774404847] [2025-03-13 21:57:22,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:22,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:22,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-03-13 21:57:22,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-03-13 21:57:22,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:22,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2612 trivial. 0 not checked. [2025-03-13 21:57:23,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:23,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774404847] [2025-03-13 21:57:23,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774404847] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:57:23,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135443834] [2025-03-13 21:57:23,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:23,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:23,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:57:23,017 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:57:23,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-13 21:57:23,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-03-13 21:57:23,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-03-13 21:57:23,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:23,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:23,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 2218 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:57:23,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:57:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2613 trivial. 0 not checked. [2025-03-13 21:57:23,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:57:23,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135443834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:23,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:57:23,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-13 21:57:23,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823626583] [2025-03-13 21:57:23,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:23,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:23,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:23,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:23,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:23,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 472 [2025-03-13 21:57:23,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 451 transitions, 1064 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:23,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:23,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 472 [2025-03-13 21:57:23,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:23,837 INFO L124 PetriNetUnfolderBase]: 53/2586 cut-off events. [2025-03-13 21:57:23,838 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-03-13 21:57:23,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2873 conditions, 2586 events. 53/2586 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 7889 event pairs, 12 based on Foata normal form. 0/2470 useless extension candidates. Maximal degree in co-relation 2354. Up to 44 conditions per place. [2025-03-13 21:57:23,844 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 12 selfloop transitions, 2 changer transitions 0/451 dead transitions. [2025-03-13 21:57:23,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 451 transitions, 1093 flow [2025-03-13 21:57:23,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:23,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:23,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-03-13 21:57:23,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961864406779661 [2025-03-13 21:57:23,845 INFO L175 Difference]: Start difference. First operand has 462 places, 451 transitions, 1064 flow. Second operand 3 states and 1362 transitions. [2025-03-13 21:57:23,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 451 transitions, 1093 flow [2025-03-13 21:57:23,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 451 transitions, 1091 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:23,851 INFO L231 Difference]: Finished difference. Result has 462 places, 450 transitions, 1064 flow [2025-03-13 21:57:23,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1064, PETRI_PLACES=462, PETRI_TRANSITIONS=450} [2025-03-13 21:57:23,851 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 3 predicate places. [2025-03-13 21:57:23,851 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 450 transitions, 1064 flow [2025-03-13 21:57:23,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:23,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:23,852 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:23,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-13 21:57:24,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-13 21:57:24,053 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:24,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:24,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1413094414, now seen corresponding path program 1 times [2025-03-13 21:57:24,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:24,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317250281] [2025-03-13 21:57:24,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:24,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:24,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-03-13 21:57:24,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-03-13 21:57:24,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:24,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:24,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 0 proven. 2464 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-13 21:57:24,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:24,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317250281] [2025-03-13 21:57:24,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317250281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:57:24,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483448456] [2025-03-13 21:57:24,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:24,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:24,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:57:24,837 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:57:24,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-13 21:57:25,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-03-13 21:57:25,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-03-13 21:57:25,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:25,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:25,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 2232 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 21:57:25,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:57:25,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 0 proven. 2464 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-13 21:57:25,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:57:26,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 0 proven. 2464 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-13 21:57:26,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483448456] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:57:26,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:57:26,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-13 21:57:26,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717257205] [2025-03-13 21:57:26,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:57:26,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-13 21:57:26,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:26,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-13 21:57:26,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-13 21:57:26,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 472 [2025-03-13 21:57:26,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 450 transitions, 1064 flow. Second operand has 34 states, 34 states have (on average 452.05882352941177) internal successors, (15370), 34 states have internal predecessors, (15370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:26,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:26,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 472 [2025-03-13 21:57:26,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:27,571 INFO L124 PetriNetUnfolderBase]: 122/4145 cut-off events. [2025-03-13 21:57:27,571 INFO L125 PetriNetUnfolderBase]: For 578/578 co-relation queries the response was YES. [2025-03-13 21:57:27,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4896 conditions, 4145 events. 122/4145 cut-off events. For 578/578 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 11092 event pairs, 10 based on Foata normal form. 16/4028 useless extension candidates. Maximal degree in co-relation 4835. Up to 67 conditions per place. [2025-03-13 21:57:27,583 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 68 selfloop transitions, 45 changer transitions 0/530 dead transitions. [2025-03-13 21:57:27,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 530 transitions, 1734 flow [2025-03-13 21:57:27,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-13 21:57:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-13 21:57:27,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 20371 transitions. [2025-03-13 21:57:27,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9590866290018832 [2025-03-13 21:57:27,593 INFO L175 Difference]: Start difference. First operand has 462 places, 450 transitions, 1064 flow. Second operand 45 states and 20371 transitions. [2025-03-13 21:57:27,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 530 transitions, 1734 flow [2025-03-13 21:57:27,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 530 transitions, 1730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:27,601 INFO L231 Difference]: Finished difference. Result has 513 places, 475 transitions, 1362 flow [2025-03-13 21:57:27,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=1362, PETRI_PLACES=513, PETRI_TRANSITIONS=475} [2025-03-13 21:57:27,602 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 54 predicate places. [2025-03-13 21:57:27,602 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 475 transitions, 1362 flow [2025-03-13 21:57:27,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 452.05882352941177) internal successors, (15370), 34 states have internal predecessors, (15370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:27,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:27,605 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:27,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-13 21:57:27,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:27,805 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:27,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:27,809 INFO L85 PathProgramCache]: Analyzing trace with hash -397418418, now seen corresponding path program 2 times [2025-03-13 21:57:27,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:27,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416955351] [2025-03-13 21:57:27,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:57:27,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:27,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1334 statements into 2 equivalence classes. [2025-03-13 21:57:27,902 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 197 of 1334 statements. [2025-03-13 21:57:27,902 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:57:27,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:28,107 INFO L134 CoverageAnalysis]: Checked inductivity of 12617 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12617 trivial. 0 not checked. [2025-03-13 21:57:28,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:28,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416955351] [2025-03-13 21:57:28,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416955351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:28,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:28,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:28,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036916723] [2025-03-13 21:57:28,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:28,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:28,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:28,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:28,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:28,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 472 [2025-03-13 21:57:28,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 475 transitions, 1362 flow. Second operand has 6 states, 6 states have (on average 400.6666666666667) internal successors, (2404), 6 states have internal predecessors, (2404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:28,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:28,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 472 [2025-03-13 21:57:28,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:29,627 INFO L124 PetriNetUnfolderBase]: 466/4463 cut-off events. [2025-03-13 21:57:29,627 INFO L125 PetriNetUnfolderBase]: For 577/577 co-relation queries the response was YES. [2025-03-13 21:57:29,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6885 conditions, 4463 events. 466/4463 cut-off events. For 577/577 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 15509 event pairs, 353 based on Foata normal form. 0/4371 useless extension candidates. Maximal degree in co-relation 5450. Up to 1085 conditions per place. [2025-03-13 21:57:29,639 INFO L140 encePairwiseOnDemand]: 463/472 looper letters, 64 selfloop transitions, 6 changer transitions 0/476 dead transitions. [2025-03-13 21:57:29,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 476 transitions, 1508 flow [2025-03-13 21:57:29,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2437 transitions. [2025-03-13 21:57:29,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8605225988700564 [2025-03-13 21:57:29,644 INFO L175 Difference]: Start difference. First operand has 513 places, 475 transitions, 1362 flow. Second operand 6 states and 2437 transitions. [2025-03-13 21:57:29,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 476 transitions, 1508 flow [2025-03-13 21:57:29,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 476 transitions, 1452 flow, removed 10 selfloop flow, removed 18 redundant places. [2025-03-13 21:57:29,652 INFO L231 Difference]: Finished difference. Result has 497 places, 472 transitions, 1312 flow [2025-03-13 21:57:29,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=492, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1312, PETRI_PLACES=497, PETRI_TRANSITIONS=472} [2025-03-13 21:57:29,653 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 38 predicate places. [2025-03-13 21:57:29,653 INFO L471 AbstractCegarLoop]: Abstraction has has 497 places, 472 transitions, 1312 flow [2025-03-13 21:57:29,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 400.6666666666667) internal successors, (2404), 6 states have internal predecessors, (2404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:29,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:29,654 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:29,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-13 21:57:29,654 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:29,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:29,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1749416276, now seen corresponding path program 1 times [2025-03-13 21:57:29,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:29,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608800949] [2025-03-13 21:57:29,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:29,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:29,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1338 statements into 1 equivalence classes. [2025-03-13 21:57:29,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1338 of 1338 statements. [2025-03-13 21:57:29,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:29,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 12618 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12617 trivial. 0 not checked. [2025-03-13 21:57:30,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:30,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608800949] [2025-03-13 21:57:30,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608800949] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:57:30,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116842336] [2025-03-13 21:57:30,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:30,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:30,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:57:30,417 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:57:30,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-13 21:57:30,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1338 statements into 1 equivalence classes. [2025-03-13 21:57:31,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1338 of 1338 statements. [2025-03-13 21:57:31,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:31,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:31,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 4154 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:57:31,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:57:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12618 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12618 trivial. 0 not checked. [2025-03-13 21:57:31,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:57:31,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116842336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:31,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:57:31,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-13 21:57:31,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559177034] [2025-03-13 21:57:31,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:31,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:31,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:31,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:31,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:31,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 472 [2025-03-13 21:57:31,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 472 transitions, 1312 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:31,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:31,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 472 [2025-03-13 21:57:31,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:32,057 INFO L124 PetriNetUnfolderBase]: 67/4060 cut-off events. [2025-03-13 21:57:32,057 INFO L125 PetriNetUnfolderBase]: For 530/530 co-relation queries the response was YES. [2025-03-13 21:57:32,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4665 conditions, 4060 events. 67/4060 cut-off events. For 530/530 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 10157 event pairs, 10 based on Foata normal form. 0/3956 useless extension candidates. Maximal degree in co-relation 3825. Up to 60 conditions per place. [2025-03-13 21:57:32,069 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 9 selfloop transitions, 0 changer transitions 5/472 dead transitions. [2025-03-13 21:57:32,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 472 transitions, 1341 flow [2025-03-13 21:57:32,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:32,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:32,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-03-13 21:57:32,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961864406779661 [2025-03-13 21:57:32,071 INFO L175 Difference]: Start difference. First operand has 497 places, 472 transitions, 1312 flow. Second operand 3 states and 1362 transitions. [2025-03-13 21:57:32,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 472 transitions, 1341 flow [2025-03-13 21:57:32,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 472 transitions, 1329 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:32,078 INFO L231 Difference]: Finished difference. Result has 493 places, 467 transitions, 1290 flow [2025-03-13 21:57:32,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1290, PETRI_PLACES=493, PETRI_TRANSITIONS=467} [2025-03-13 21:57:32,079 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 34 predicate places. [2025-03-13 21:57:32,079 INFO L471 AbstractCegarLoop]: Abstraction has has 493 places, 467 transitions, 1290 flow [2025-03-13 21:57:32,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:32,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:32,080 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:32,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-13 21:57:32,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-13 21:57:32,280 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting t2Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:32,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:32,284 INFO L85 PathProgramCache]: Analyzing trace with hash -33364687, now seen corresponding path program 1 times [2025-03-13 21:57:32,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:32,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827192816] [2025-03-13 21:57:32,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:32,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:32,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1340 statements into 1 equivalence classes. [2025-03-13 21:57:32,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1340 of 1340 statements. [2025-03-13 21:57:32,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:32,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:35,202 INFO L134 CoverageAnalysis]: Checked inductivity of 12617 backedges. 0 proven. 12300 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-03-13 21:57:35,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:35,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827192816] [2025-03-13 21:57:35,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827192816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:57:35,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523188514] [2025-03-13 21:57:35,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:35,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:35,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:57:35,204 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:57:35,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-13 21:57:35,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1340 statements into 1 equivalence classes. [2025-03-13 21:57:36,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1340 of 1340 statements. [2025-03-13 21:57:36,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:36,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:36,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 4186 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-13 21:57:36,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:57:36,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12617 backedges. 0 proven. 12300 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-03-13 21:57:36,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:57:37,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12617 backedges. 0 proven. 12300 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-03-13 21:57:37,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523188514] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:57:37,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:57:37,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2025-03-13 21:57:37,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553729261] [2025-03-13 21:57:37,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:57:37,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-13 21:57:37,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:37,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-13 21:57:37,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2025-03-13 21:57:38,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 472 [2025-03-13 21:57:38,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 467 transitions, 1290 flow. Second operand has 43 states, 43 states have (on average 452.09302325581393) internal successors, (19440), 43 states have internal predecessors, (19440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:38,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:38,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 472 [2025-03-13 21:57:38,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:39,945 INFO L124 PetriNetUnfolderBase]: 150/5061 cut-off events. [2025-03-13 21:57:39,945 INFO L125 PetriNetUnfolderBase]: For 1840/1840 co-relation queries the response was YES. [2025-03-13 21:57:39,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6163 conditions, 5061 events. 150/5061 cut-off events. For 1840/1840 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 12589 event pairs, 10 based on Foata normal form. 10/4956 useless extension candidates. Maximal degree in co-relation 6137. Up to 87 conditions per place. [2025-03-13 21:57:39,963 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 88 selfloop transitions, 60 changer transitions 0/557 dead transitions. [2025-03-13 21:57:39,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 557 transitions, 2134 flow [2025-03-13 21:57:39,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-13 21:57:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-03-13 21:57:39,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 27153 transitions. [2025-03-13 21:57:39,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9587923728813559 [2025-03-13 21:57:39,976 INFO L175 Difference]: Start difference. First operand has 493 places, 467 transitions, 1290 flow. Second operand 60 states and 27153 transitions. [2025-03-13 21:57:39,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 557 transitions, 2134 flow [2025-03-13 21:57:39,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 557 transitions, 2134 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:57:39,986 INFO L231 Difference]: Finished difference. Result has 554 places, 483 transitions, 1584 flow [2025-03-13 21:57:39,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=1584, PETRI_PLACES=554, PETRI_TRANSITIONS=483} [2025-03-13 21:57:39,987 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 95 predicate places. [2025-03-13 21:57:39,987 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 483 transitions, 1584 flow [2025-03-13 21:57:39,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 452.09302325581393) internal successors, (19440), 43 states have internal predecessors, (19440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:39,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:39,991 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:40,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-13 21:57:40,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:40,192 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting t2Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:40,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:40,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1939764179, now seen corresponding path program 2 times [2025-03-13 21:57:40,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:40,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330713781] [2025-03-13 21:57:40,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:57:40,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:40,309 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1715 statements into 2 equivalence classes. [2025-03-13 21:57:40,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 180 of 1715 statements. [2025-03-13 21:57:40,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:57:40,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:40,554 INFO L134 CoverageAnalysis]: Checked inductivity of 22681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22681 trivial. 0 not checked. [2025-03-13 21:57:40,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:40,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330713781] [2025-03-13 21:57:40,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330713781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:40,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:40,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:40,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501830198] [2025-03-13 21:57:40,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:40,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:40,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:40,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:40,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:41,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 472 [2025-03-13 21:57:41,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 483 transitions, 1584 flow. Second operand has 6 states, 6 states have (on average 408.8333333333333) internal successors, (2453), 6 states have internal predecessors, (2453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:41,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:41,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 472 [2025-03-13 21:57:41,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:42,787 INFO L124 PetriNetUnfolderBase]: 554/5455 cut-off events. [2025-03-13 21:57:42,787 INFO L125 PetriNetUnfolderBase]: For 1115/1115 co-relation queries the response was YES. [2025-03-13 21:57:42,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8578 conditions, 5455 events. 554/5455 cut-off events. For 1115/1115 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 18013 event pairs, 473 based on Foata normal form. 0/5349 useless extension candidates. Maximal degree in co-relation 8546. Up to 1437 conditions per place. [2025-03-13 21:57:42,800 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 59 selfloop transitions, 5 changer transitions 0/486 dead transitions. [2025-03-13 21:57:42,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 486 transitions, 1722 flow [2025-03-13 21:57:42,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:42,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:42,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2477 transitions. [2025-03-13 21:57:42,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8746468926553672 [2025-03-13 21:57:42,802 INFO L175 Difference]: Start difference. First operand has 554 places, 483 transitions, 1584 flow. Second operand 6 states and 2477 transitions. [2025-03-13 21:57:42,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 486 transitions, 1722 flow [2025-03-13 21:57:42,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 486 transitions, 1624 flow, removed 7 selfloop flow, removed 42 redundant places. [2025-03-13 21:57:42,815 INFO L231 Difference]: Finished difference. Result has 516 places, 482 transitions, 1494 flow [2025-03-13 21:57:42,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1494, PETRI_PLACES=516, PETRI_TRANSITIONS=482} [2025-03-13 21:57:42,815 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 57 predicate places. [2025-03-13 21:57:42,815 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 482 transitions, 1494 flow [2025-03-13 21:57:42,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 408.8333333333333) internal successors, (2453), 6 states have internal predecessors, (2453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:42,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:42,816 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:42,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-13 21:57:42,816 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting t2Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:42,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:42,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1933437851, now seen corresponding path program 1 times [2025-03-13 21:57:42,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:42,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021953696] [2025-03-13 21:57:42,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:42,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:42,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1724 statements into 1 equivalence classes. [2025-03-13 21:57:43,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1724 of 1724 statements. [2025-03-13 21:57:43,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:43,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 22681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22681 trivial. 0 not checked. [2025-03-13 21:57:47,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:47,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021953696] [2025-03-13 21:57:47,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021953696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:47,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:47,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:47,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792308009] [2025-03-13 21:57:47,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:47,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:47,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:47,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:47,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:47,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 472 [2025-03-13 21:57:47,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 482 transitions, 1494 flow. Second operand has 6 states, 6 states have (on average 417.6666666666667) internal successors, (2506), 6 states have internal predecessors, (2506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:47,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:47,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 472 [2025-03-13 21:57:47,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:49,410 INFO L124 PetriNetUnfolderBase]: 518/5411 cut-off events. [2025-03-13 21:57:49,410 INFO L125 PetriNetUnfolderBase]: For 1087/1087 co-relation queries the response was YES. [2025-03-13 21:57:49,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8369 conditions, 5411 events. 518/5411 cut-off events. For 1087/1087 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 17501 event pairs, 437 based on Foata normal form. 0/5321 useless extension candidates. Maximal degree in co-relation 8336. Up to 1329 conditions per place. [2025-03-13 21:57:49,425 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 50 selfloop transitions, 5 changer transitions 0/485 dead transitions. [2025-03-13 21:57:49,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 485 transitions, 1614 flow [2025-03-13 21:57:49,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:49,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2522 transitions. [2025-03-13 21:57:49,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8905367231638418 [2025-03-13 21:57:49,427 INFO L175 Difference]: Start difference. First operand has 516 places, 482 transitions, 1494 flow. Second operand 6 states and 2522 transitions. [2025-03-13 21:57:49,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 485 transitions, 1614 flow [2025-03-13 21:57:49,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 485 transitions, 1604 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:49,438 INFO L231 Difference]: Finished difference. Result has 515 places, 481 transitions, 1492 flow [2025-03-13 21:57:49,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=515, PETRI_TRANSITIONS=481} [2025-03-13 21:57:49,439 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 56 predicate places. [2025-03-13 21:57:49,439 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 481 transitions, 1492 flow [2025-03-13 21:57:49,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 417.6666666666667) internal successors, (2506), 6 states have internal predecessors, (2506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:49,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:49,440 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:49,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-13 21:57:49,440 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting t2Err7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:49,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:49,444 INFO L85 PathProgramCache]: Analyzing trace with hash -557683693, now seen corresponding path program 1 times [2025-03-13 21:57:49,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:49,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78579859] [2025-03-13 21:57:49,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:49,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:49,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1732 statements into 1 equivalence classes. [2025-03-13 21:57:49,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1732 of 1732 statements. [2025-03-13 21:57:49,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:49,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 22681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22681 trivial. 0 not checked. [2025-03-13 21:57:54,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:54,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78579859] [2025-03-13 21:57:54,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78579859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:54,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:54,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:54,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592063362] [2025-03-13 21:57:54,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:54,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:54,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:54,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:54,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:54,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 472 [2025-03-13 21:57:54,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 481 transitions, 1492 flow. Second operand has 6 states, 6 states have (on average 382.0) internal successors, (2292), 6 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:54,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:54,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 472 [2025-03-13 21:57:54,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:56,224 INFO L124 PetriNetUnfolderBase]: 894/5779 cut-off events. [2025-03-13 21:57:56,224 INFO L125 PetriNetUnfolderBase]: For 1151/1151 co-relation queries the response was YES. [2025-03-13 21:57:56,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10513 conditions, 5779 events. 894/5779 cut-off events. For 1151/1151 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 22234 event pairs, 813 based on Foata normal form. 0/5689 useless extension candidates. Maximal degree in co-relation 10480. Up to 2465 conditions per place. [2025-03-13 21:57:56,239 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 92 selfloop transitions, 5 changer transitions 0/484 dead transitions. [2025-03-13 21:57:56,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 484 transitions, 1696 flow [2025-03-13 21:57:56,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:56,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2312 transitions. [2025-03-13 21:57:56,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8163841807909604 [2025-03-13 21:57:56,240 INFO L175 Difference]: Start difference. First operand has 515 places, 481 transitions, 1492 flow. Second operand 6 states and 2312 transitions. [2025-03-13 21:57:56,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 484 transitions, 1696 flow [2025-03-13 21:57:56,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 484 transitions, 1686 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:56,249 INFO L231 Difference]: Finished difference. Result has 514 places, 480 transitions, 1490 flow [2025-03-13 21:57:56,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1490, PETRI_PLACES=514, PETRI_TRANSITIONS=480} [2025-03-13 21:57:56,250 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 55 predicate places. [2025-03-13 21:57:56,250 INFO L471 AbstractCegarLoop]: Abstraction has has 514 places, 480 transitions, 1490 flow [2025-03-13 21:57:56,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 382.0) internal successors, (2292), 6 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:57:56,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:56,251 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:56,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-13 21:57:56,251 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting t2Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:56,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:56,256 INFO L85 PathProgramCache]: Analyzing trace with hash 214897700, now seen corresponding path program 1 times [2025-03-13 21:57:56,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:56,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988115699] [2025-03-13 21:57:56,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:56,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:56,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1750 statements into 1 equivalence classes. [2025-03-13 21:57:56,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1750 of 1750 statements. [2025-03-13 21:57:56,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:56,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 22686 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22686 trivial. 0 not checked. [2025-03-13 21:58:00,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:00,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988115699] [2025-03-13 21:58:00,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988115699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:00,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:00,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:58:00,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077412752] [2025-03-13 21:58:00,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:00,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:58:00,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:00,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:58:00,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:58:01,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 472 [2025-03-13 21:58:01,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 480 transitions, 1490 flow. Second operand has 6 states, 6 states have (on average 367.8333333333333) internal successors, (2207), 6 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:01,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:01,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 472 [2025-03-13 21:58:01,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:03,306 INFO L124 PetriNetUnfolderBase]: 950/5827 cut-off events. [2025-03-13 21:58:03,306 INFO L125 PetriNetUnfolderBase]: For 1199/1199 co-relation queries the response was YES. [2025-03-13 21:58:03,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10737 conditions, 5827 events. 950/5827 cut-off events. For 1199/1199 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 22735 event pairs, 869 based on Foata normal form. 0/5753 useless extension candidates. Maximal degree in co-relation 10704. Up to 2641 conditions per place. [2025-03-13 21:58:03,319 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 107 selfloop transitions, 5 changer transitions 0/483 dead transitions. [2025-03-13 21:58:03,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 483 transitions, 1724 flow [2025-03-13 21:58:03,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:58:03,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:58:03,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2237 transitions. [2025-03-13 21:58:03,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7899011299435028 [2025-03-13 21:58:03,321 INFO L175 Difference]: Start difference. First operand has 514 places, 480 transitions, 1490 flow. Second operand 6 states and 2237 transitions. [2025-03-13 21:58:03,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 483 transitions, 1724 flow [2025-03-13 21:58:03,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 483 transitions, 1714 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:58:03,329 INFO L231 Difference]: Finished difference. Result has 513 places, 479 transitions, 1488 flow [2025-03-13 21:58:03,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1478, PETRI_DIFFERENCE_MINUEND_PLACES=508, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1488, PETRI_PLACES=513, PETRI_TRANSITIONS=479} [2025-03-13 21:58:03,330 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 54 predicate places. [2025-03-13 21:58:03,330 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 479 transitions, 1488 flow [2025-03-13 21:58:03,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 367.8333333333333) internal successors, (2207), 6 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:03,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:03,331 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:03,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-13 21:58:03,331 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting t2Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:58:03,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:03,334 INFO L85 PathProgramCache]: Analyzing trace with hash 788877584, now seen corresponding path program 1 times [2025-03-13 21:58:03,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:03,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370757027] [2025-03-13 21:58:03,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:03,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:03,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1757 statements into 1 equivalence classes. [2025-03-13 21:58:03,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1757 of 1757 statements. [2025-03-13 21:58:03,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:03,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 22699 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22699 trivial. 0 not checked. [2025-03-13 21:58:07,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:07,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370757027] [2025-03-13 21:58:07,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370757027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:07,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:07,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:58:07,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229366504] [2025-03-13 21:58:07,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:07,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:58:07,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:07,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:58:07,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:58:08,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 472 [2025-03-13 21:58:08,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 479 transitions, 1488 flow. Second operand has 6 states, 6 states have (on average 369.6666666666667) internal successors, (2218), 6 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:08,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:08,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 472 [2025-03-13 21:58:08,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:10,056 INFO L124 PetriNetUnfolderBase]: 950/5843 cut-off events. [2025-03-13 21:58:10,056 INFO L125 PetriNetUnfolderBase]: For 1207/1207 co-relation queries the response was YES. [2025-03-13 21:58:10,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10753 conditions, 5843 events. 950/5843 cut-off events. For 1207/1207 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 22886 event pairs, 869 based on Foata normal form. 0/5769 useless extension candidates. Maximal degree in co-relation 10720. Up to 2641 conditions per place. [2025-03-13 21:58:10,078 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 107 selfloop transitions, 5 changer transitions 0/483 dead transitions. [2025-03-13 21:58:10,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 483 transitions, 1724 flow [2025-03-13 21:58:10,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:58:10,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:58:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2243 transitions. [2025-03-13 21:58:10,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7920197740112994 [2025-03-13 21:58:10,081 INFO L175 Difference]: Start difference. First operand has 513 places, 479 transitions, 1488 flow. Second operand 6 states and 2243 transitions. [2025-03-13 21:58:10,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 483 transitions, 1724 flow [2025-03-13 21:58:10,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 483 transitions, 1714 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:58:10,089 INFO L231 Difference]: Finished difference. Result has 513 places, 479 transitions, 1492 flow [2025-03-13 21:58:10,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=507, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=513, PETRI_TRANSITIONS=479} [2025-03-13 21:58:10,090 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 54 predicate places. [2025-03-13 21:58:10,090 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 479 transitions, 1492 flow [2025-03-13 21:58:10,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 369.6666666666667) internal successors, (2218), 6 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:58:10,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:10,091 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:10,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-13 21:58:10,091 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:58:10,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:10,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1877902575, now seen corresponding path program 1 times [2025-03-13 21:58:10,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:10,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541547620] [2025-03-13 21:58:10,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:10,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:10,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1762 statements into 1 equivalence classes. [2025-03-13 21:58:10,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1762 of 1762 statements. [2025-03-13 21:58:10,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:10,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat