./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:04:15,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:04:15,625 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:04:15,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:04:15,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:04:15,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:04:15,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:04:15,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:04:15,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:04:15,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:04:15,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:04:15,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:04:15,655 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:04:15,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:04:15,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:04:15,657 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:04:15,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:04:15,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:04:15,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:04:15,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:04:15,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:04:15,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:04:15,658 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:04:15,658 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:04:15,658 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:04:15,658 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:04:15,658 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:04:15,658 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:04:15,658 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:04:15,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:04:15,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:04:15,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:04:15,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:04:15,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:04:15,659 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:04:15,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:04:15,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:04:15,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:04:15,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:04:15,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:04:15,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:04:15,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:04:15,659 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 -> 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 [2025-03-08 22:04:15,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:04:15,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:04:15,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:04:15,899 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:04:15,900 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:04:15,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2025-03-08 22:04:17,134 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a98ecf01/5d1f4d7f06a34d1cba2ea43b8a4d92e5/FLAGbf5775783 [2025-03-08 22:04:17,380 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:04:17,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2025-03-08 22:04:17,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a98ecf01/5d1f4d7f06a34d1cba2ea43b8a4d92e5/FLAGbf5775783 [2025-03-08 22:04:17,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a98ecf01/5d1f4d7f06a34d1cba2ea43b8a4d92e5 [2025-03-08 22:04:17,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:04:17,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:04:17,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:04:17,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:04:17,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:04:17,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:04:17" (1/1) ... [2025-03-08 22:04:17,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:17, skipping insertion in model container [2025-03-08 22:04:17,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:04:17" (1/1) ... [2025-03-08 22:04:17,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:04:17,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:04:17,862 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:04:17,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:04:17,892 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:04:17,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:17 WrapperNode [2025-03-08 22:04:17,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:04:17,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:04:17,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:04:17,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:04:17,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:17" (1/1) ... [2025-03-08 22:04:17,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:17" (1/1) ... [2025-03-08 22:04:17,924 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 343 [2025-03-08 22:04:17,924 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:04:17,925 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:04:17,925 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:04:17,925 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:04:17,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:17" (1/1) ... [2025-03-08 22:04:17,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:17" (1/1) ... [2025-03-08 22:04:17,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:17" (1/1) ... [2025-03-08 22:04:17,933 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:17" (1/1) ... [2025-03-08 22:04:17,943 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:17" (1/1) ... [2025-03-08 22:04:17,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:17" (1/1) ... [2025-03-08 22:04:17,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:17" (1/1) ... [2025-03-08 22:04:17,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:17" (1/1) ... [2025-03-08 22:04:17,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:04:17,952 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:04:17,952 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:04:17,952 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:04:17,957 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:17" (1/1) ... [2025-03-08 22:04:17,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:04:17,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:04:17,991 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-08 22:04:17,993 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-08 22:04:18,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:04:18,012 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 22:04:18,012 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 22:04:18,012 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 22:04:18,012 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 22:04:18,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:04:18,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:04:18,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:04:18,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:04:18,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:04:18,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:04:18,015 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:04:18,098 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:04:18,099 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:04:18,634 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:04:18,634 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:04:18,653 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:04:18,657 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:04:18,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:04:18 BoogieIcfgContainer [2025-03-08 22:04:18,657 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:04:18,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:04:18,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:04:18,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:04:18,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:04:17" (1/3) ... [2025-03-08 22:04:18,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5b3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:04:18, skipping insertion in model container [2025-03-08 22:04:18,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:17" (2/3) ... [2025-03-08 22:04:18,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5b3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:04:18, skipping insertion in model container [2025-03-08 22:04:18,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:04:18" (3/3) ... [2025-03-08 22:04:18,665 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2025-03-08 22:04:18,675 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:04:18,676 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-symm.wvr.c that has 3 procedures, 434 locations, 1 initial locations, 4 loop locations, and 42 error locations. [2025-03-08 22:04:18,676 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:04:18,816 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 22:04:18,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 440 places, 457 transitions, 928 flow [2025-03-08 22:04:18,995 INFO L124 PetriNetUnfolderBase]: 24/455 cut-off events. [2025-03-08 22:04:18,996 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 22:04:19,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 455 events. 24/455 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 917 event pairs, 0 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 272. Up to 3 conditions per place. [2025-03-08 22:04:19,003 INFO L82 GeneralOperation]: Start removeDead. Operand has 440 places, 457 transitions, 928 flow [2025-03-08 22:04:19,009 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 420 places, 435 transitions, 882 flow [2025-03-08 22:04:19,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:04:19,027 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;@f52829c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:04:19,027 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2025-03-08 22:04:19,031 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:04:19,031 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-08 22:04:19,031 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:04:19,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:19,032 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] [2025-03-08 22:04:19,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:19,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:19,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1988918833, now seen corresponding path program 1 times [2025-03-08 22:04:19,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:19,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032784114] [2025-03-08 22:04:19,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:19,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:19,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 22:04:19,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 22:04:19,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:19,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:19,167 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-08 22:04:19,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:19,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032784114] [2025-03-08 22:04:19,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032784114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:19,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:19,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:19,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540131692] [2025-03-08 22:04:19,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:19,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:19,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:19,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:19,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:19,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 457 [2025-03-08 22:04:19,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 435 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 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-08 22:04:19,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:19,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 457 [2025-03-08 22:04:19,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:19,428 INFO L124 PetriNetUnfolderBase]: 27/762 cut-off events. [2025-03-08 22:04:19,429 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-08 22:04:19,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 762 events. 27/762 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2931 event pairs, 8 based on Foata normal form. 16/658 useless extension candidates. Maximal degree in co-relation 591. Up to 29 conditions per place. [2025-03-08 22:04:19,439 INFO L140 encePairwiseOnDemand]: 442/457 looper letters, 12 selfloop transitions, 2 changer transitions 6/422 dead transitions. [2025-03-08 22:04:19,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 422 transitions, 884 flow [2025-03-08 22:04:19,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1308 transitions. [2025-03-08 22:04:19,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540481400437637 [2025-03-08 22:04:19,462 INFO L175 Difference]: Start difference. First operand has 420 places, 435 transitions, 882 flow. Second operand 3 states and 1308 transitions. [2025-03-08 22:04:19,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 422 transitions, 884 flow [2025-03-08 22:04:19,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 422 transitions, 876 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 22:04:19,477 INFO L231 Difference]: Finished difference. Result has 417 places, 416 transitions, 840 flow [2025-03-08 22:04:19,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=840, PETRI_PLACES=417, PETRI_TRANSITIONS=416} [2025-03-08 22:04:19,484 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -3 predicate places. [2025-03-08 22:04:19,486 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 416 transitions, 840 flow [2025-03-08 22:04:19,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 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-08 22:04:19,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:19,487 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] [2025-03-08 22:04:19,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:04:19,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:19,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:19,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1306738378, now seen corresponding path program 1 times [2025-03-08 22:04:19,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:19,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890785270] [2025-03-08 22:04:19,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:19,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:19,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 22:04:19,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 22:04:19,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:19,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:19,544 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-08 22:04:19,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:19,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890785270] [2025-03-08 22:04:19,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890785270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:19,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:19,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:19,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916651726] [2025-03-08 22:04:19,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:19,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:19,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:19,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:19,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:19,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 457 [2025-03-08 22:04:19,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 416 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 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-08 22:04:19,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:19,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 457 [2025-03-08 22:04:19,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:19,690 INFO L124 PetriNetUnfolderBase]: 27/746 cut-off events. [2025-03-08 22:04:19,690 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:04:19,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 746 events. 27/746 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2888 event pairs, 8 based on Foata normal form. 0/637 useless extension candidates. Maximal degree in co-relation 755. Up to 29 conditions per place. [2025-03-08 22:04:19,696 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 12 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2025-03-08 22:04:19,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 415 transitions, 866 flow [2025-03-08 22:04:19,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:19,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1296 transitions. [2025-03-08 22:04:19,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9452954048140044 [2025-03-08 22:04:19,699 INFO L175 Difference]: Start difference. First operand has 417 places, 416 transitions, 840 flow. Second operand 3 states and 1296 transitions. [2025-03-08 22:04:19,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 415 transitions, 866 flow [2025-03-08 22:04:19,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 415 transitions, 862 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:19,708 INFO L231 Difference]: Finished difference. Result has 410 places, 415 transitions, 838 flow [2025-03-08 22:04:19,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=410, PETRI_TRANSITIONS=415} [2025-03-08 22:04:19,709 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -10 predicate places. [2025-03-08 22:04:19,709 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 415 transitions, 838 flow [2025-03-08 22:04:19,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 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-08 22:04:19,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:19,710 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:19,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:04:19,711 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:19,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:19,712 INFO L85 PathProgramCache]: Analyzing trace with hash -405295681, now seen corresponding path program 1 times [2025-03-08 22:04:19,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:19,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378471763] [2025-03-08 22:04:19,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:19,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:19,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 22:04:19,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 22:04:19,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:19,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:19,756 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-08 22:04:19,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:19,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378471763] [2025-03-08 22:04:19,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378471763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:19,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:19,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:19,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984270987] [2025-03-08 22:04:19,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:19,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:19,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:19,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:19,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:19,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 457 [2025-03-08 22:04:19,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 415 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-08 22:04:19,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:19,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 457 [2025-03-08 22:04:19,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:19,983 INFO L124 PetriNetUnfolderBase]: 62/1354 cut-off events. [2025-03-08 22:04:19,983 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 22:04:19,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1433 conditions, 1354 events. 62/1354 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7800 event pairs, 24 based on Foata normal form. 0/1156 useless extension candidates. Maximal degree in co-relation 1395. Up to 67 conditions per place. [2025-03-08 22:04:19,992 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 14 selfloop transitions, 1 changer transitions 0/410 dead transitions. [2025-03-08 22:04:19,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 410 transitions, 858 flow [2025-03-08 22:04:19,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1289 transitions. [2025-03-08 22:04:19,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9401896425966448 [2025-03-08 22:04:19,996 INFO L175 Difference]: Start difference. First operand has 410 places, 415 transitions, 838 flow. Second operand 3 states and 1289 transitions. [2025-03-08 22:04:19,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 410 transitions, 858 flow [2025-03-08 22:04:20,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 410 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:20,004 INFO L231 Difference]: Finished difference. Result has 405 places, 410 transitions, 826 flow [2025-03-08 22:04:20,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=405, PETRI_TRANSITIONS=410} [2025-03-08 22:04:20,006 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -15 predicate places. [2025-03-08 22:04:20,007 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 410 transitions, 826 flow [2025-03-08 22:04:20,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-08 22:04:20,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:20,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:20,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:04:20,008 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:20,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:20,009 INFO L85 PathProgramCache]: Analyzing trace with hash -2090748116, now seen corresponding path program 1 times [2025-03-08 22:04:20,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:20,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077683538] [2025-03-08 22:04:20,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:20,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:20,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 22:04:20,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 22:04:20,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:20,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:20,605 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-08 22:04:20,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:20,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077683538] [2025-03-08 22:04:20,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077683538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:20,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:20,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:20,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606070089] [2025-03-08 22:04:20,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:20,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:04:20,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:20,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:04:20,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:04:20,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 457 [2025-03-08 22:04:20,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 410 transitions, 826 flow. Second operand has 6 states, 6 states have (on average 380.5) internal successors, (2283), 6 states have internal predecessors, (2283), 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-08 22:04:20,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:20,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 457 [2025-03-08 22:04:20,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:21,207 INFO L124 PetriNetUnfolderBase]: 393/2924 cut-off events. [2025-03-08 22:04:21,207 INFO L125 PetriNetUnfolderBase]: For 46/47 co-relation queries the response was YES. [2025-03-08 22:04:21,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3646 conditions, 2924 events. 393/2924 cut-off events. For 46/47 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 22509 event pairs, 288 based on Foata normal form. 0/2523 useless extension candidates. Maximal degree in co-relation 3609. Up to 691 conditions per place. [2025-03-08 22:04:21,225 INFO L140 encePairwiseOnDemand]: 445/457 looper letters, 52 selfloop transitions, 10 changer transitions 0/408 dead transitions. [2025-03-08 22:04:21,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 408 transitions, 946 flow [2025-03-08 22:04:21,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:21,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:21,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2338 transitions. [2025-03-08 22:04:21,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8526622902990518 [2025-03-08 22:04:21,230 INFO L175 Difference]: Start difference. First operand has 405 places, 410 transitions, 826 flow. Second operand 6 states and 2338 transitions. [2025-03-08 22:04:21,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 408 transitions, 946 flow [2025-03-08 22:04:21,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 408 transitions, 945 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:04:21,235 INFO L231 Difference]: Finished difference. Result has 407 places, 408 transitions, 841 flow [2025-03-08 22:04:21,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=841, PETRI_PLACES=407, PETRI_TRANSITIONS=408} [2025-03-08 22:04:21,237 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -13 predicate places. [2025-03-08 22:04:21,237 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 408 transitions, 841 flow [2025-03-08 22:04:21,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 380.5) internal successors, (2283), 6 states have internal predecessors, (2283), 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-08 22:04:21,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:21,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:21,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:04:21,239 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:21,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:21,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1221293673, now seen corresponding path program 1 times [2025-03-08 22:04:21,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:21,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861974994] [2025-03-08 22:04:21,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:21,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:21,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 22:04:21,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 22:04:21,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:21,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:21,275 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-08 22:04:21,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:21,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861974994] [2025-03-08 22:04:21,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861974994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:21,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:21,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:21,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124398004] [2025-03-08 22:04:21,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:21,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:21,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:21,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:21,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:21,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 457 [2025-03-08 22:04:21,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 408 transitions, 841 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 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-08 22:04:21,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:21,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 457 [2025-03-08 22:04:21,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:21,363 INFO L124 PetriNetUnfolderBase]: 24/643 cut-off events. [2025-03-08 22:04:21,363 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-08 22:04:21,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 643 events. 24/643 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2166 event pairs, 8 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 657. Up to 28 conditions per place. [2025-03-08 22:04:21,368 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 11 selfloop transitions, 2 changer transitions 0/407 dead transitions. [2025-03-08 22:04:21,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 407 transitions, 865 flow [2025-03-08 22:04:21,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:21,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2025-03-08 22:04:21,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9467541940189642 [2025-03-08 22:04:21,372 INFO L175 Difference]: Start difference. First operand has 407 places, 408 transitions, 841 flow. Second operand 3 states and 1298 transitions. [2025-03-08 22:04:21,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 407 transitions, 865 flow [2025-03-08 22:04:21,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 407 transitions, 845 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:04:21,379 INFO L231 Difference]: Finished difference. Result has 403 places, 407 transitions, 823 flow [2025-03-08 22:04:21,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=823, PETRI_PLACES=403, PETRI_TRANSITIONS=407} [2025-03-08 22:04:21,381 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -17 predicate places. [2025-03-08 22:04:21,382 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 407 transitions, 823 flow [2025-03-08 22:04:21,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 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-08 22:04:21,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:21,384 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:21,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:04:21,384 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:21,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:21,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1857329254, now seen corresponding path program 1 times [2025-03-08 22:04:21,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:21,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321130866] [2025-03-08 22:04:21,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:21,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:21,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 22:04:21,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 22:04:21,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:21,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:21,428 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-08 22:04:21,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:21,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321130866] [2025-03-08 22:04:21,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321130866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:21,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:21,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:21,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252507924] [2025-03-08 22:04:21,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:21,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:21,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:21,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:21,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:21,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 457 [2025-03-08 22:04:21,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 407 transitions, 823 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-08 22:04:21,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:21,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 457 [2025-03-08 22:04:21,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:21,569 INFO L124 PetriNetUnfolderBase]: 65/1347 cut-off events. [2025-03-08 22:04:21,569 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-08 22:04:21,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 1347 events. 65/1347 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7672 event pairs, 24 based on Foata normal form. 0/1169 useless extension candidates. Maximal degree in co-relation 1391. Up to 69 conditions per place. [2025-03-08 22:04:21,579 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 14 selfloop transitions, 1 changer transitions 0/402 dead transitions. [2025-03-08 22:04:21,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 402 transitions, 843 flow [2025-03-08 22:04:21,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:21,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:21,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1289 transitions. [2025-03-08 22:04:21,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9401896425966448 [2025-03-08 22:04:21,581 INFO L175 Difference]: Start difference. First operand has 403 places, 407 transitions, 823 flow. Second operand 3 states and 1289 transitions. [2025-03-08 22:04:21,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 402 transitions, 843 flow [2025-03-08 22:04:21,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 402 transitions, 839 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:21,587 INFO L231 Difference]: Finished difference. Result has 398 places, 402 transitions, 811 flow [2025-03-08 22:04:21,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=811, PETRI_PLACES=398, PETRI_TRANSITIONS=402} [2025-03-08 22:04:21,588 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -22 predicate places. [2025-03-08 22:04:21,588 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 402 transitions, 811 flow [2025-03-08 22:04:21,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-08 22:04:21,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:21,590 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] [2025-03-08 22:04:21,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:04:21,590 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:21,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:21,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1274785333, now seen corresponding path program 1 times [2025-03-08 22:04:21,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:21,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635838974] [2025-03-08 22:04:21,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:21,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:21,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 22:04:21,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 22:04:21,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:21,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:21,631 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-08 22:04:21,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:21,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635838974] [2025-03-08 22:04:21,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635838974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:21,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:21,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:21,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484989305] [2025-03-08 22:04:21,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:21,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:21,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:21,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:21,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:21,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 457 [2025-03-08 22:04:21,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 402 transitions, 811 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 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-08 22:04:21,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:21,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 457 [2025-03-08 22:04:21,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:21,717 INFO L124 PetriNetUnfolderBase]: 24/633 cut-off events. [2025-03-08 22:04:21,717 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-08 22:04:21,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 633 events. 24/633 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2032 event pairs, 8 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 633. Up to 28 conditions per place. [2025-03-08 22:04:21,722 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 11 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2025-03-08 22:04:21,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 401 transitions, 835 flow [2025-03-08 22:04:21,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:21,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2025-03-08 22:04:21,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9467541940189642 [2025-03-08 22:04:21,725 INFO L175 Difference]: Start difference. First operand has 398 places, 402 transitions, 811 flow. Second operand 3 states and 1298 transitions. [2025-03-08 22:04:21,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 401 transitions, 835 flow [2025-03-08 22:04:21,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 401 transitions, 834 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:04:21,729 INFO L231 Difference]: Finished difference. Result has 398 places, 401 transitions, 812 flow [2025-03-08 22:04:21,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=398, PETRI_TRANSITIONS=401} [2025-03-08 22:04:21,731 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -22 predicate places. [2025-03-08 22:04:21,732 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 401 transitions, 812 flow [2025-03-08 22:04:21,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 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-08 22:04:21,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:21,733 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] [2025-03-08 22:04:21,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:04:21,733 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:21,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:21,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1235435109, now seen corresponding path program 1 times [2025-03-08 22:04:21,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:21,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118981953] [2025-03-08 22:04:21,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:21,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:21,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 22:04:21,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 22:04:21,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:21,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:21,788 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-08 22:04:21,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:21,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118981953] [2025-03-08 22:04:21,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118981953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:21,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:21,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:21,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275082785] [2025-03-08 22:04:21,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:21,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:21,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:21,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:21,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:21,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 457 [2025-03-08 22:04:21,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 401 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 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-08 22:04:21,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:21,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 457 [2025-03-08 22:04:21,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:21,876 INFO L124 PetriNetUnfolderBase]: 21/615 cut-off events. [2025-03-08 22:04:21,876 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-08 22:04:21,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 615 events. 21/615 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2001 event pairs, 3 based on Foata normal form. 1/548 useless extension candidates. Maximal degree in co-relation 614. Up to 17 conditions per place. [2025-03-08 22:04:21,880 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 11 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2025-03-08 22:04:21,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 401 transitions, 839 flow [2025-03-08 22:04:21,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:21,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1304 transitions. [2025-03-08 22:04:21,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9511305616338439 [2025-03-08 22:04:21,882 INFO L175 Difference]: Start difference. First operand has 398 places, 401 transitions, 812 flow. Second operand 3 states and 1304 transitions. [2025-03-08 22:04:21,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 401 transitions, 839 flow [2025-03-08 22:04:21,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 401 transitions, 835 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:21,890 INFO L231 Difference]: Finished difference. Result has 397 places, 400 transitions, 810 flow [2025-03-08 22:04:21,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=397, PETRI_TRANSITIONS=400} [2025-03-08 22:04:21,892 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -23 predicate places. [2025-03-08 22:04:21,892 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 400 transitions, 810 flow [2025-03-08 22:04:21,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 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-08 22:04:21,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:21,893 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] [2025-03-08 22:04:21,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:04:21,894 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:21,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:21,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2124406037, now seen corresponding path program 1 times [2025-03-08 22:04:21,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:21,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862842470] [2025-03-08 22:04:21,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:21,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:21,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 22:04:21,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 22:04:21,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:21,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:21,934 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-08 22:04:21,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:21,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862842470] [2025-03-08 22:04:21,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862842470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:21,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:21,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:21,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753128118] [2025-03-08 22:04:21,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:21,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:21,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:21,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:21,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:21,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 457 [2025-03-08 22:04:21,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 400 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 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-08 22:04:21,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:21,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 457 [2025-03-08 22:04:21,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:21,999 INFO L124 PetriNetUnfolderBase]: 18/504 cut-off events. [2025-03-08 22:04:21,999 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-03-08 22:04:22,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 504 events. 18/504 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1282 event pairs, 3 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 498. Up to 17 conditions per place. [2025-03-08 22:04:22,002 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 11 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2025-03-08 22:04:22,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 400 transitions, 837 flow [2025-03-08 22:04:22,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:22,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1304 transitions. [2025-03-08 22:04:22,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9511305616338439 [2025-03-08 22:04:22,005 INFO L175 Difference]: Start difference. First operand has 397 places, 400 transitions, 810 flow. Second operand 3 states and 1304 transitions. [2025-03-08 22:04:22,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 400 transitions, 837 flow [2025-03-08 22:04:22,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 400 transitions, 833 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:22,009 INFO L231 Difference]: Finished difference. Result has 396 places, 399 transitions, 808 flow [2025-03-08 22:04:22,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=808, PETRI_PLACES=396, PETRI_TRANSITIONS=399} [2025-03-08 22:04:22,010 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -24 predicate places. [2025-03-08 22:04:22,010 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 399 transitions, 808 flow [2025-03-08 22:04:22,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 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-08 22:04:22,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:22,011 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:22,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:04:22,012 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:22,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:22,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1416488519, now seen corresponding path program 1 times [2025-03-08 22:04:22,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:22,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977039976] [2025-03-08 22:04:22,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:22,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:22,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 22:04:22,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 22:04:22,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:22,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:22,050 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-08 22:04:22,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:22,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977039976] [2025-03-08 22:04:22,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977039976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:22,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:22,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:04:22,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944946155] [2025-03-08 22:04:22,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:22,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:22,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:22,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:22,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:22,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 457 [2025-03-08 22:04:22,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 399 transitions, 808 flow. Second operand has 3 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 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-08 22:04:22,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:22,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 457 [2025-03-08 22:04:22,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:22,114 INFO L124 PetriNetUnfolderBase]: 24/615 cut-off events. [2025-03-08 22:04:22,114 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2025-03-08 22:04:22,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 615 events. 24/615 cut-off events. For 2/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1954 event pairs, 6 based on Foata normal form. 1/550 useless extension candidates. Maximal degree in co-relation 628. Up to 24 conditions per place. [2025-03-08 22:04:22,118 INFO L140 encePairwiseOnDemand]: 453/457 looper letters, 11 selfloop transitions, 3 changer transitions 0/401 dead transitions. [2025-03-08 22:04:22,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 401 transitions, 841 flow [2025-03-08 22:04:22,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1308 transitions. [2025-03-08 22:04:22,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540481400437637 [2025-03-08 22:04:22,121 INFO L175 Difference]: Start difference. First operand has 396 places, 399 transitions, 808 flow. Second operand 3 states and 1308 transitions. [2025-03-08 22:04:22,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 401 transitions, 841 flow [2025-03-08 22:04:22,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 401 transitions, 837 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:22,128 INFO L231 Difference]: Finished difference. Result has 398 places, 400 transitions, 822 flow [2025-03-08 22:04:22,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=398, PETRI_TRANSITIONS=400} [2025-03-08 22:04:22,129 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -22 predicate places. [2025-03-08 22:04:22,129 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 400 transitions, 822 flow [2025-03-08 22:04:22,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 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-08 22:04:22,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:22,130 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] [2025-03-08 22:04:22,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:04:22,130 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:22,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:22,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2132041132, now seen corresponding path program 1 times [2025-03-08 22:04:22,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:22,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364375671] [2025-03-08 22:04:22,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:22,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:22,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 22:04:22,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 22:04:22,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:22,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:22,177 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-08 22:04:22,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:22,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364375671] [2025-03-08 22:04:22,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364375671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:22,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:22,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:22,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791371268] [2025-03-08 22:04:22,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:22,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:22,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:22,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:22,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:22,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 457 [2025-03-08 22:04:22,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 400 transitions, 822 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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-08 22:04:22,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:22,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 457 [2025-03-08 22:04:22,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:22,311 INFO L124 PetriNetUnfolderBase]: 69/1225 cut-off events. [2025-03-08 22:04:22,311 INFO L125 PetriNetUnfolderBase]: For 22/23 co-relation queries the response was YES. [2025-03-08 22:04:22,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 1225 events. 69/1225 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6622 event pairs, 12 based on Foata normal form. 0/1091 useless extension candidates. Maximal degree in co-relation 1315. Up to 79 conditions per place. [2025-03-08 22:04:22,325 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 16 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2025-03-08 22:04:22,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 401 transitions, 863 flow [2025-03-08 22:04:22,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:22,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2025-03-08 22:04:22,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9482129832239241 [2025-03-08 22:04:22,328 INFO L175 Difference]: Start difference. First operand has 398 places, 400 transitions, 822 flow. Second operand 3 states and 1300 transitions. [2025-03-08 22:04:22,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 401 transitions, 863 flow [2025-03-08 22:04:22,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 401 transitions, 857 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:22,335 INFO L231 Difference]: Finished difference. Result has 395 places, 398 transitions, 822 flow [2025-03-08 22:04:22,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=395, PETRI_TRANSITIONS=398} [2025-03-08 22:04:22,336 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -25 predicate places. [2025-03-08 22:04:22,336 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 398 transitions, 822 flow [2025-03-08 22:04:22,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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-08 22:04:22,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:22,338 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] [2025-03-08 22:04:22,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:04:22,338 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:22,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:22,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1178619895, now seen corresponding path program 1 times [2025-03-08 22:04:22,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:22,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008954802] [2025-03-08 22:04:22,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:22,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:22,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 22:04:22,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 22:04:22,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:22,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:22,540 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-08 22:04:22,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:22,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008954802] [2025-03-08 22:04:22,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008954802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:22,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:22,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:04:22,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130447316] [2025-03-08 22:04:22,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:22,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:04:22,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:22,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:04:22,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:04:22,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 457 [2025-03-08 22:04:22,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 398 transitions, 822 flow. Second operand has 8 states, 8 states have (on average 412.125) internal successors, (3297), 8 states have internal predecessors, (3297), 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-08 22:04:22,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:22,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 457 [2025-03-08 22:04:22,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:23,078 INFO L124 PetriNetUnfolderBase]: 65/1275 cut-off events. [2025-03-08 22:04:23,079 INFO L125 PetriNetUnfolderBase]: For 7/19 co-relation queries the response was YES. [2025-03-08 22:04:23,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1493 conditions, 1275 events. 65/1275 cut-off events. For 7/19 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6561 event pairs, 15 based on Foata normal form. 3/1156 useless extension candidates. Maximal degree in co-relation 1453. Up to 70 conditions per place. [2025-03-08 22:04:23,086 INFO L140 encePairwiseOnDemand]: 441/457 looper letters, 43 selfloop transitions, 18 changer transitions 0/424 dead transitions. [2025-03-08 22:04:23,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 424 transitions, 1009 flow [2025-03-08 22:04:23,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:04:23,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-08 22:04:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 4970 transitions. [2025-03-08 22:04:23,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9062727935813275 [2025-03-08 22:04:23,095 INFO L175 Difference]: Start difference. First operand has 395 places, 398 transitions, 822 flow. Second operand 12 states and 4970 transitions. [2025-03-08 22:04:23,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 424 transitions, 1009 flow [2025-03-08 22:04:23,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 424 transitions, 1009 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:23,101 INFO L231 Difference]: Finished difference. Result has 412 places, 407 transitions, 915 flow [2025-03-08 22:04:23,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=915, PETRI_PLACES=412, PETRI_TRANSITIONS=407} [2025-03-08 22:04:23,102 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -8 predicate places. [2025-03-08 22:04:23,102 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 407 transitions, 915 flow [2025-03-08 22:04:23,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 412.125) internal successors, (3297), 8 states have internal predecessors, (3297), 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-08 22:04:23,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:23,104 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] [2025-03-08 22:04:23,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:04:23,104 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:23,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:23,105 INFO L85 PathProgramCache]: Analyzing trace with hash 498497591, now seen corresponding path program 1 times [2025-03-08 22:04:23,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:23,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901715014] [2025-03-08 22:04:23,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:23,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:23,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 22:04:23,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 22:04:23,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:23,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:23,156 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-08 22:04:23,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:23,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901715014] [2025-03-08 22:04:23,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901715014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:23,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:23,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:04:23,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209337553] [2025-03-08 22:04:23,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:23,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:23,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:23,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:23,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:23,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 457 [2025-03-08 22:04:23,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 407 transitions, 915 flow. Second operand has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 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-08 22:04:23,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:23,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 457 [2025-03-08 22:04:23,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:23,271 INFO L124 PetriNetUnfolderBase]: 86/1151 cut-off events. [2025-03-08 22:04:23,272 INFO L125 PetriNetUnfolderBase]: For 72/75 co-relation queries the response was YES. [2025-03-08 22:04:23,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 1151 events. 86/1151 cut-off events. For 72/75 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6133 event pairs, 24 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 1340. Up to 98 conditions per place. [2025-03-08 22:04:23,280 INFO L140 encePairwiseOnDemand]: 453/457 looper letters, 11 selfloop transitions, 3 changer transitions 0/409 dead transitions. [2025-03-08 22:04:23,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 409 transitions, 948 flow [2025-03-08 22:04:23,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:23,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1308 transitions. [2025-03-08 22:04:23,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540481400437637 [2025-03-08 22:04:23,283 INFO L175 Difference]: Start difference. First operand has 412 places, 407 transitions, 915 flow. Second operand 3 states and 1308 transitions. [2025-03-08 22:04:23,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 409 transitions, 948 flow [2025-03-08 22:04:23,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 409 transitions, 948 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:23,291 INFO L231 Difference]: Finished difference. Result has 416 places, 408 transitions, 933 flow [2025-03-08 22:04:23,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=933, PETRI_PLACES=416, PETRI_TRANSITIONS=408} [2025-03-08 22:04:23,292 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -4 predicate places. [2025-03-08 22:04:23,292 INFO L471 AbstractCegarLoop]: Abstraction has has 416 places, 408 transitions, 933 flow [2025-03-08 22:04:23,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 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-08 22:04:23,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:23,293 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:23,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:04:23,293 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:23,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:23,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1404534691, now seen corresponding path program 1 times [2025-03-08 22:04:23,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:23,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609075222] [2025-03-08 22:04:23,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:23,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:23,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 22:04:23,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 22:04:23,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:23,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:23,437 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-08 22:04:23,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:23,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609075222] [2025-03-08 22:04:23,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609075222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:23,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:23,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:04:23,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650805904] [2025-03-08 22:04:23,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:23,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:04:23,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:23,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:04:23,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:04:23,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 457 [2025-03-08 22:04:23,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 408 transitions, 933 flow. Second operand has 8 states, 8 states have (on average 412.25) internal successors, (3298), 8 states have internal predecessors, (3298), 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-08 22:04:23,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:23,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 457 [2025-03-08 22:04:23,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:23,989 INFO L124 PetriNetUnfolderBase]: 68/917 cut-off events. [2025-03-08 22:04:23,989 INFO L125 PetriNetUnfolderBase]: For 84/87 co-relation queries the response was YES. [2025-03-08 22:04:23,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 917 events. 68/917 cut-off events. For 84/87 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4072 event pairs, 20 based on Foata normal form. 2/847 useless extension candidates. Maximal degree in co-relation 1149. Up to 105 conditions per place. [2025-03-08 22:04:24,000 INFO L140 encePairwiseOnDemand]: 443/457 looper letters, 45 selfloop transitions, 15 changer transitions 0/428 dead transitions. [2025-03-08 22:04:24,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 428 transitions, 1109 flow [2025-03-08 22:04:24,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:04:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 22:04:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4559 transitions. [2025-03-08 22:04:24,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9069027252834693 [2025-03-08 22:04:24,009 INFO L175 Difference]: Start difference. First operand has 416 places, 408 transitions, 933 flow. Second operand 11 states and 4559 transitions. [2025-03-08 22:04:24,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 428 transitions, 1109 flow [2025-03-08 22:04:24,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 428 transitions, 1099 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:24,016 INFO L231 Difference]: Finished difference. Result has 427 places, 411 transitions, 982 flow [2025-03-08 22:04:24,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=982, PETRI_PLACES=427, PETRI_TRANSITIONS=411} [2025-03-08 22:04:24,017 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, 7 predicate places. [2025-03-08 22:04:24,017 INFO L471 AbstractCegarLoop]: Abstraction has has 427 places, 411 transitions, 982 flow [2025-03-08 22:04:24,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 412.25) internal successors, (3298), 8 states have internal predecessors, (3298), 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-08 22:04:24,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:24,018 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] [2025-03-08 22:04:24,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:04:24,018 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:24,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:24,019 INFO L85 PathProgramCache]: Analyzing trace with hash 232542745, now seen corresponding path program 1 times [2025-03-08 22:04:24,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:24,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326080809] [2025-03-08 22:04:24,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:24,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:24,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 22:04:24,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 22:04:24,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:24,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:24,183 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-08 22:04:24,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:24,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326080809] [2025-03-08 22:04:24,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326080809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:24,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:24,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:04:24,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427332577] [2025-03-08 22:04:24,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:24,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:04:24,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:24,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:04:24,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:04:24,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 457 [2025-03-08 22:04:24,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 411 transitions, 982 flow. Second operand has 8 states, 8 states have (on average 412.25) internal successors, (3298), 8 states have internal predecessors, (3298), 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-08 22:04:24,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:24,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 457 [2025-03-08 22:04:24,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:24,857 INFO L124 PetriNetUnfolderBase]: 75/1344 cut-off events. [2025-03-08 22:04:24,858 INFO L125 PetriNetUnfolderBase]: For 109/127 co-relation queries the response was YES. [2025-03-08 22:04:24,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 1344 events. 75/1344 cut-off events. For 109/127 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6850 event pairs, 23 based on Foata normal form. 4/1249 useless extension candidates. Maximal degree in co-relation 1762. Up to 114 conditions per place. [2025-03-08 22:04:24,867 INFO L140 encePairwiseOnDemand]: 442/457 looper letters, 48 selfloop transitions, 19 changer transitions 0/434 dead transitions. [2025-03-08 22:04:24,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 434 transitions, 1209 flow [2025-03-08 22:04:24,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:04:24,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 22:04:24,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4552 transitions. [2025-03-08 22:04:24,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9055102446787349 [2025-03-08 22:04:24,876 INFO L175 Difference]: Start difference. First operand has 427 places, 411 transitions, 982 flow. Second operand 11 states and 4552 transitions. [2025-03-08 22:04:24,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 434 transitions, 1209 flow [2025-03-08 22:04:24,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 434 transitions, 1188 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-08 22:04:24,884 INFO L231 Difference]: Finished difference. Result has 435 places, 423 transitions, 1093 flow [2025-03-08 22:04:24,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1093, PETRI_PLACES=435, PETRI_TRANSITIONS=423} [2025-03-08 22:04:24,885 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, 15 predicate places. [2025-03-08 22:04:24,885 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 423 transitions, 1093 flow [2025-03-08 22:04:24,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 412.25) internal successors, (3298), 8 states have internal predecessors, (3298), 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-08 22:04:24,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:24,887 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] [2025-03-08 22:04:24,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:04:24,887 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:24,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:24,888 INFO L85 PathProgramCache]: Analyzing trace with hash 569303295, now seen corresponding path program 1 times [2025-03-08 22:04:24,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:24,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140840500] [2025-03-08 22:04:24,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:24,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:24,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 22:04:24,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 22:04:24,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:24,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:25,059 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-08 22:04:25,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:25,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140840500] [2025-03-08 22:04:25,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140840500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:25,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:25,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:04:25,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804660131] [2025-03-08 22:04:25,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:25,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:04:25,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:25,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:04:25,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:04:25,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 457 [2025-03-08 22:04:25,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 423 transitions, 1093 flow. Second operand has 8 states, 8 states have (on average 412.375) internal successors, (3299), 8 states have internal predecessors, (3299), 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-08 22:04:25,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:25,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 457 [2025-03-08 22:04:25,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:25,549 INFO L124 PetriNetUnfolderBase]: 87/1207 cut-off events. [2025-03-08 22:04:25,549 INFO L125 PetriNetUnfolderBase]: For 204/209 co-relation queries the response was YES. [2025-03-08 22:04:25,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1690 conditions, 1207 events. 87/1207 cut-off events. For 204/209 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6228 event pairs, 23 based on Foata normal form. 0/1116 useless extension candidates. Maximal degree in co-relation 1625. Up to 101 conditions per place. [2025-03-08 22:04:25,558 INFO L140 encePairwiseOnDemand]: 441/457 looper letters, 44 selfloop transitions, 22 changer transitions 0/441 dead transitions. [2025-03-08 22:04:25,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 441 transitions, 1298 flow [2025-03-08 22:04:25,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:04:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-08 22:04:25,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 4963 transitions. [2025-03-08 22:04:25,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9049963530269876 [2025-03-08 22:04:25,567 INFO L175 Difference]: Start difference. First operand has 435 places, 423 transitions, 1093 flow. Second operand 12 states and 4963 transitions. [2025-03-08 22:04:25,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 441 transitions, 1298 flow [2025-03-08 22:04:25,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 441 transitions, 1294 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:04:25,573 INFO L231 Difference]: Finished difference. Result has 449 places, 430 transitions, 1200 flow [2025-03-08 22:04:25,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1200, PETRI_PLACES=449, PETRI_TRANSITIONS=430} [2025-03-08 22:04:25,574 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, 29 predicate places. [2025-03-08 22:04:25,575 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 430 transitions, 1200 flow [2025-03-08 22:04:25,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 412.375) internal successors, (3299), 8 states have internal predecessors, (3299), 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-08 22:04:25,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:25,576 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] [2025-03-08 22:04:25,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:04:25,576 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:25,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:25,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1182774204, now seen corresponding path program 1 times [2025-03-08 22:04:25,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:25,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331195617] [2025-03-08 22:04:25,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:25,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:25,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 22:04:25,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 22:04:25,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:25,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:25,612 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-08 22:04:25,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:25,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331195617] [2025-03-08 22:04:25,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331195617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:25,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:25,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:25,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936957634] [2025-03-08 22:04:25,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:25,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:25,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:25,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:25,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:25,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 457 [2025-03-08 22:04:25,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 430 transitions, 1200 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 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-08 22:04:25,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:25,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 457 [2025-03-08 22:04:25,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:25,757 INFO L124 PetriNetUnfolderBase]: 43/1283 cut-off events. [2025-03-08 22:04:25,758 INFO L125 PetriNetUnfolderBase]: For 219/230 co-relation queries the response was YES. [2025-03-08 22:04:25,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1752 conditions, 1283 events. 43/1283 cut-off events. For 219/230 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 5431 event pairs, 5 based on Foata normal form. 0/1207 useless extension candidates. Maximal degree in co-relation 1683. Up to 36 conditions per place. [2025-03-08 22:04:25,766 INFO L140 encePairwiseOnDemand]: 453/457 looper letters, 11 selfloop transitions, 1 changer transitions 0/427 dead transitions. [2025-03-08 22:04:25,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 427 transitions, 1218 flow [2025-03-08 22:04:25,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:25,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:25,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1299 transitions. [2025-03-08 22:04:25,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9474835886214442 [2025-03-08 22:04:25,768 INFO L175 Difference]: Start difference. First operand has 449 places, 430 transitions, 1200 flow. Second operand 3 states and 1299 transitions. [2025-03-08 22:04:25,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 427 transitions, 1218 flow [2025-03-08 22:04:25,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 427 transitions, 1201 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 22:04:25,775 INFO L231 Difference]: Finished difference. Result has 442 places, 427 transitions, 1179 flow [2025-03-08 22:04:25,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1179, PETRI_PLACES=442, PETRI_TRANSITIONS=427} [2025-03-08 22:04:25,776 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, 22 predicate places. [2025-03-08 22:04:25,776 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 427 transitions, 1179 flow [2025-03-08 22:04:25,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 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-08 22:04:25,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:25,781 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] [2025-03-08 22:04:25,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:04:25,781 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:25,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:25,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1397012916, now seen corresponding path program 1 times [2025-03-08 22:04:25,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:25,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141278135] [2025-03-08 22:04:25,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:25,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:25,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 22:04:25,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 22:04:25,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:25,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:25,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:25,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141278135] [2025-03-08 22:04:25,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141278135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:25,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:25,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:25,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40543158] [2025-03-08 22:04:25,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:25,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:25,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:25,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:25,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:25,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 457 [2025-03-08 22:04:25,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 427 transitions, 1179 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 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-08 22:04:25,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:25,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 457 [2025-03-08 22:04:25,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:25,940 INFO L124 PetriNetUnfolderBase]: 46/1243 cut-off events. [2025-03-08 22:04:25,940 INFO L125 PetriNetUnfolderBase]: For 193/198 co-relation queries the response was YES. [2025-03-08 22:04:25,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1674 conditions, 1243 events. 46/1243 cut-off events. For 193/198 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5773 event pairs, 6 based on Foata normal form. 5/1187 useless extension candidates. Maximal degree in co-relation 1604. Up to 38 conditions per place. [2025-03-08 22:04:25,947 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 5 selfloop transitions, 0 changer transitions 67/426 dead transitions. [2025-03-08 22:04:25,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 426 transitions, 1203 flow [2025-03-08 22:04:25,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2025-03-08 22:04:25,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9482129832239241 [2025-03-08 22:04:25,949 INFO L175 Difference]: Start difference. First operand has 442 places, 427 transitions, 1179 flow. Second operand 3 states and 1300 transitions. [2025-03-08 22:04:25,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 426 transitions, 1203 flow [2025-03-08 22:04:25,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 426 transitions, 1202 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:04:25,955 INFO L231 Difference]: Finished difference. Result has 440 places, 359 transitions, 869 flow [2025-03-08 22:04:25,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=1172, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=869, PETRI_PLACES=440, PETRI_TRANSITIONS=359} [2025-03-08 22:04:25,955 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, 20 predicate places. [2025-03-08 22:04:25,955 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 359 transitions, 869 flow [2025-03-08 22:04:25,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 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-08 22:04:25,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:25,956 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] [2025-03-08 22:04:25,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:04:25,956 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:25,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:25,957 INFO L85 PathProgramCache]: Analyzing trace with hash 612174821, now seen corresponding path program 1 times [2025-03-08 22:04:25,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:25,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137216524] [2025-03-08 22:04:25,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:25,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:25,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 22:04:25,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 22:04:25,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:25,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:04:26,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:26,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137216524] [2025-03-08 22:04:26,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137216524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:26,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:26,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:26,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224456289] [2025-03-08 22:04:26,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:26,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:04:26,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:26,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:04:26,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:04:26,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 457 [2025-03-08 22:04:26,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 359 transitions, 869 flow. Second operand has 6 states, 6 states have (on average 417.8333333333333) internal successors, (2507), 6 states have internal predecessors, (2507), 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-08 22:04:26,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:26,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 457 [2025-03-08 22:04:26,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:26,744 INFO L124 PetriNetUnfolderBase]: 29/648 cut-off events. [2025-03-08 22:04:26,744 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-08 22:04:26,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 648 events. 29/648 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1920 event pairs, 2 based on Foata normal form. 0/610 useless extension candidates. Maximal degree in co-relation 885. Up to 29 conditions per place. [2025-03-08 22:04:26,750 INFO L140 encePairwiseOnDemand]: 450/457 looper letters, 25 selfloop transitions, 5 changer transitions 0/362 dead transitions. [2025-03-08 22:04:26,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 362 transitions, 940 flow [2025-03-08 22:04:26,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:26,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2522 transitions. [2025-03-08 22:04:26,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9197665937272064 [2025-03-08 22:04:26,753 INFO L175 Difference]: Start difference. First operand has 440 places, 359 transitions, 869 flow. Second operand 6 states and 2522 transitions. [2025-03-08 22:04:26,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 362 transitions, 940 flow [2025-03-08 22:04:26,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 362 transitions, 854 flow, removed 17 selfloop flow, removed 26 redundant places. [2025-03-08 22:04:26,760 INFO L231 Difference]: Finished difference. Result has 367 places, 357 transitions, 789 flow [2025-03-08 22:04:26,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=789, PETRI_PLACES=367, PETRI_TRANSITIONS=357} [2025-03-08 22:04:26,761 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -53 predicate places. [2025-03-08 22:04:26,761 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 357 transitions, 789 flow [2025-03-08 22:04:26,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 417.8333333333333) internal successors, (2507), 6 states have internal predecessors, (2507), 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-08 22:04:26,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:26,762 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] [2025-03-08 22:04:26,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:04:26,762 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:26,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:26,763 INFO L85 PathProgramCache]: Analyzing trace with hash -110486938, now seen corresponding path program 1 times [2025-03-08 22:04:26,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:26,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009933551] [2025-03-08 22:04:26,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:26,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:26,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 22:04:26,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 22:04:26,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:26,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:04:26,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:26,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009933551] [2025-03-08 22:04:26,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009933551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:26,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:26,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:26,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418823867] [2025-03-08 22:04:26,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:26,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:26,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:26,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:26,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:26,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 457 [2025-03-08 22:04:26,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 357 transitions, 789 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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-08 22:04:26,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:26,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 457 [2025-03-08 22:04:26,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:26,942 INFO L124 PetriNetUnfolderBase]: 68/1259 cut-off events. [2025-03-08 22:04:26,943 INFO L125 PetriNetUnfolderBase]: For 37/38 co-relation queries the response was YES. [2025-03-08 22:04:26,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1479 conditions, 1259 events. 68/1259 cut-off events. For 37/38 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6596 event pairs, 17 based on Foata normal form. 0/1166 useless extension candidates. Maximal degree in co-relation 1468. Up to 85 conditions per place. [2025-03-08 22:04:26,950 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 14 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-03-08 22:04:26,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 357 transitions, 823 flow [2025-03-08 22:04:26,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:26,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:26,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2025-03-08 22:04:26,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9467541940189642 [2025-03-08 22:04:26,952 INFO L175 Difference]: Start difference. First operand has 367 places, 357 transitions, 789 flow. Second operand 3 states and 1298 transitions. [2025-03-08 22:04:26,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 357 transitions, 823 flow [2025-03-08 22:04:26,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 357 transitions, 813 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:04:26,957 INFO L231 Difference]: Finished difference. Result has 361 places, 355 transitions, 785 flow [2025-03-08 22:04:26,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=785, PETRI_PLACES=361, PETRI_TRANSITIONS=355} [2025-03-08 22:04:26,958 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -59 predicate places. [2025-03-08 22:04:26,958 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 355 transitions, 785 flow [2025-03-08 22:04:26,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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-08 22:04:26,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:26,958 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-08 22:04:26,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:04:26,959 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:26,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:26,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1222119883, now seen corresponding path program 1 times [2025-03-08 22:04:26,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:26,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772840354] [2025-03-08 22:04:26,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:26,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:26,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 22:04:26,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 22:04:26,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:26,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:27,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:04:27,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:27,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772840354] [2025-03-08 22:04:27,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772840354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:27,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:27,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:27,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381249167] [2025-03-08 22:04:27,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:27,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:04:27,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:27,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:04:27,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:04:27,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 457 [2025-03-08 22:04:27,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 355 transitions, 785 flow. Second operand has 6 states, 6 states have (on average 418.0) internal successors, (2508), 6 states have internal predecessors, (2508), 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-08 22:04:27,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:27,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 457 [2025-03-08 22:04:27,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:27,685 INFO L124 PetriNetUnfolderBase]: 57/799 cut-off events. [2025-03-08 22:04:27,686 INFO L125 PetriNetUnfolderBase]: For 52/54 co-relation queries the response was YES. [2025-03-08 22:04:27,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 799 events. 57/799 cut-off events. For 52/54 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3432 event pairs, 4 based on Foata normal form. 0/766 useless extension candidates. Maximal degree in co-relation 1013. Up to 52 conditions per place. [2025-03-08 22:04:27,690 INFO L140 encePairwiseOnDemand]: 450/457 looper letters, 24 selfloop transitions, 5 changer transitions 0/357 dead transitions. [2025-03-08 22:04:27,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 357 transitions, 851 flow [2025-03-08 22:04:27,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:27,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2521 transitions. [2025-03-08 22:04:27,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9194018964259665 [2025-03-08 22:04:27,693 INFO L175 Difference]: Start difference. First operand has 361 places, 355 transitions, 785 flow. Second operand 6 states and 2521 transitions. [2025-03-08 22:04:27,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 357 transitions, 851 flow [2025-03-08 22:04:27,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 357 transitions, 851 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:27,697 INFO L231 Difference]: Finished difference. Result has 364 places, 353 transitions, 791 flow [2025-03-08 22:04:27,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=791, PETRI_PLACES=364, PETRI_TRANSITIONS=353} [2025-03-08 22:04:27,698 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -56 predicate places. [2025-03-08 22:04:27,698 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 353 transitions, 791 flow [2025-03-08 22:04:27,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 418.0) internal successors, (2508), 6 states have internal predecessors, (2508), 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-08 22:04:27,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:27,699 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] [2025-03-08 22:04:27,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:04:27,699 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:27,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:27,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1646852535, now seen corresponding path program 1 times [2025-03-08 22:04:27,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:27,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913222141] [2025-03-08 22:04:27,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:27,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:27,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 22:04:27,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 22:04:27,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:27,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:04:27,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:27,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913222141] [2025-03-08 22:04:27,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913222141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:27,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:27,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:27,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380823386] [2025-03-08 22:04:27,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:27,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:04:27,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:27,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:04:27,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:04:28,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 457 [2025-03-08 22:04:28,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 353 transitions, 791 flow. Second operand has 6 states, 6 states have (on average 417.8333333333333) internal successors, (2507), 6 states have internal predecessors, (2507), 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-08 22:04:28,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:28,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 457 [2025-03-08 22:04:28,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:28,443 INFO L124 PetriNetUnfolderBase]: 33/766 cut-off events. [2025-03-08 22:04:28,443 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-08 22:04:28,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 766 events. 33/766 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2623 event pairs, 3 based on Foata normal form. 0/738 useless extension candidates. Maximal degree in co-relation 956. Up to 29 conditions per place. [2025-03-08 22:04:28,450 INFO L140 encePairwiseOnDemand]: 450/457 looper letters, 25 selfloop transitions, 5 changer transitions 0/356 dead transitions. [2025-03-08 22:04:28,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 356 transitions, 862 flow [2025-03-08 22:04:28,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:28,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2522 transitions. [2025-03-08 22:04:28,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9197665937272064 [2025-03-08 22:04:28,453 INFO L175 Difference]: Start difference. First operand has 364 places, 353 transitions, 791 flow. Second operand 6 states and 2522 transitions. [2025-03-08 22:04:28,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 356 transitions, 862 flow [2025-03-08 22:04:28,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 356 transitions, 852 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:04:28,458 INFO L231 Difference]: Finished difference. Result has 362 places, 351 transitions, 787 flow [2025-03-08 22:04:28,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=787, PETRI_PLACES=362, PETRI_TRANSITIONS=351} [2025-03-08 22:04:28,459 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -58 predicate places. [2025-03-08 22:04:28,459 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 351 transitions, 787 flow [2025-03-08 22:04:28,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 417.8333333333333) internal successors, (2507), 6 states have internal predecessors, (2507), 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-08 22:04:28,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:28,460 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-08 22:04:28,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:04:28,460 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:28,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:28,461 INFO L85 PathProgramCache]: Analyzing trace with hash -80449617, now seen corresponding path program 1 times [2025-03-08 22:04:28,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:28,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434297073] [2025-03-08 22:04:28,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:28,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:28,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 22:04:28,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 22:04:28,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:28,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:04:28,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:28,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434297073] [2025-03-08 22:04:28,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434297073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:28,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:28,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:28,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294846325] [2025-03-08 22:04:28,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:28,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:04:28,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:28,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:04:28,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:04:29,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 457 [2025-03-08 22:04:29,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 351 transitions, 787 flow. Second operand has 6 states, 6 states have (on average 418.0) internal successors, (2508), 6 states have internal predecessors, (2508), 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-08 22:04:29,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:29,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 457 [2025-03-08 22:04:29,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:29,282 INFO L124 PetriNetUnfolderBase]: 60/895 cut-off events. [2025-03-08 22:04:29,282 INFO L125 PetriNetUnfolderBase]: For 57/60 co-relation queries the response was YES. [2025-03-08 22:04:29,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 895 events. 60/895 cut-off events. For 57/60 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4003 event pairs, 6 based on Foata normal form. 0/860 useless extension candidates. Maximal degree in co-relation 1122. Up to 56 conditions per place. [2025-03-08 22:04:29,288 INFO L140 encePairwiseOnDemand]: 450/457 looper letters, 24 selfloop transitions, 5 changer transitions 0/353 dead transitions. [2025-03-08 22:04:29,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 353 transitions, 853 flow [2025-03-08 22:04:29,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:29,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2521 transitions. [2025-03-08 22:04:29,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9194018964259665 [2025-03-08 22:04:29,290 INFO L175 Difference]: Start difference. First operand has 362 places, 351 transitions, 787 flow. Second operand 6 states and 2521 transitions. [2025-03-08 22:04:29,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 353 transitions, 853 flow [2025-03-08 22:04:29,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 353 transitions, 843 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:04:29,294 INFO L231 Difference]: Finished difference. Result has 360 places, 349 transitions, 783 flow [2025-03-08 22:04:29,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=783, PETRI_PLACES=360, PETRI_TRANSITIONS=349} [2025-03-08 22:04:29,295 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -60 predicate places. [2025-03-08 22:04:29,295 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 349 transitions, 783 flow [2025-03-08 22:04:29,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 418.0) internal successors, (2508), 6 states have internal predecessors, (2508), 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-08 22:04:29,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:29,296 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] [2025-03-08 22:04:29,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:04:29,296 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:29,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:29,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1664908730, now seen corresponding path program 1 times [2025-03-08 22:04:29,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:29,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679199453] [2025-03-08 22:04:29,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:29,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:29,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 22:04:29,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 22:04:29,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:29,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:29,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:04:29,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:29,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679199453] [2025-03-08 22:04:29,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679199453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:29,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:29,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:29,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666509648] [2025-03-08 22:04:29,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:29,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:29,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:29,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:29,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:29,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 457 [2025-03-08 22:04:29,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 349 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 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-08 22:04:29,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:29,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 457 [2025-03-08 22:04:29,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:29,425 INFO L124 PetriNetUnfolderBase]: 29/866 cut-off events. [2025-03-08 22:04:29,425 INFO L125 PetriNetUnfolderBase]: For 21/23 co-relation queries the response was YES. [2025-03-08 22:04:29,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 866 events. 29/866 cut-off events. For 21/23 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2840 event pairs, 3 based on Foata normal form. 0/840 useless extension candidates. Maximal degree in co-relation 1018. Up to 21 conditions per place. [2025-03-08 22:04:29,430 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 7 selfloop transitions, 2 changer transitions 0/349 dead transitions. [2025-03-08 22:04:29,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 349 transitions, 802 flow [2025-03-08 22:04:29,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:29,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2025-03-08 22:04:29,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9482129832239241 [2025-03-08 22:04:29,431 INFO L175 Difference]: Start difference. First operand has 360 places, 349 transitions, 783 flow. Second operand 3 states and 1300 transitions. [2025-03-08 22:04:29,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 349 transitions, 802 flow [2025-03-08 22:04:29,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 349 transitions, 792 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:04:29,434 INFO L231 Difference]: Finished difference. Result has 356 places, 348 transitions, 775 flow [2025-03-08 22:04:29,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=356, PETRI_TRANSITIONS=348} [2025-03-08 22:04:29,435 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -64 predicate places. [2025-03-08 22:04:29,435 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 348 transitions, 775 flow [2025-03-08 22:04:29,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 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-08 22:04:29,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:29,436 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] [2025-03-08 22:04:29,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:04:29,436 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-08 22:04:29,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:29,437 INFO L85 PathProgramCache]: Analyzing trace with hash -827517369, now seen corresponding path program 1 times [2025-03-08 22:04:29,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:29,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411546357] [2025-03-08 22:04:29,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:29,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:29,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-08 22:04:29,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-08 22:04:29,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:29,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:04:29,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:29,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411546357] [2025-03-08 22:04:29,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411546357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:29,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:29,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:29,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825312554] [2025-03-08 22:04:29,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:29,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:29,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:29,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:29,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:29,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 457 [2025-03-08 22:04:29,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 348 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 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-08 22:04:29,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:29,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 457 [2025-03-08 22:04:29,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:29,547 INFO L124 PetriNetUnfolderBase]: 35/736 cut-off events. [2025-03-08 22:04:29,548 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2025-03-08 22:04:29,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 736 events. 35/736 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2581 event pairs, 4 based on Foata normal form. 0/718 useless extension candidates. Maximal degree in co-relation 865. Up to 20 conditions per place. [2025-03-08 22:04:29,551 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 0 selfloop transitions, 0 changer transitions 348/348 dead transitions. [2025-03-08 22:04:29,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 348 transitions, 794 flow [2025-03-08 22:04:29,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:29,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2025-03-08 22:04:29,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9482129832239241 [2025-03-08 22:04:29,552 INFO L175 Difference]: Start difference. First operand has 356 places, 348 transitions, 775 flow. Second operand 3 states and 1300 transitions. [2025-03-08 22:04:29,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 348 transitions, 794 flow [2025-03-08 22:04:29,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 348 transitions, 790 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:29,555 INFO L231 Difference]: Finished difference. Result has 355 places, 0 transitions, 0 flow [2025-03-08 22:04:29,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=355, PETRI_TRANSITIONS=0} [2025-03-08 22:04:29,555 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -65 predicate places. [2025-03-08 22:04:29,555 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 0 transitions, 0 flow [2025-03-08 22:04:29,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 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-08 22:04:29,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (71 of 72 remaining) [2025-03-08 22:04:29,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (70 of 72 remaining) [2025-03-08 22:04:29,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (69 of 72 remaining) [2025-03-08 22:04:29,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (68 of 72 remaining) [2025-03-08 22:04:29,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (67 of 72 remaining) [2025-03-08 22:04:29,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (66 of 72 remaining) [2025-03-08 22:04:29,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (65 of 72 remaining) [2025-03-08 22:04:29,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (64 of 72 remaining) [2025-03-08 22:04:29,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (63 of 72 remaining) [2025-03-08 22:04:29,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (62 of 72 remaining) [2025-03-08 22:04:29,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (61 of 72 remaining) [2025-03-08 22:04:29,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (60 of 72 remaining) [2025-03-08 22:04:29,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (59 of 72 remaining) [2025-03-08 22:04:29,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (58 of 72 remaining) [2025-03-08 22:04:29,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (57 of 72 remaining) [2025-03-08 22:04:29,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (56 of 72 remaining) [2025-03-08 22:04:29,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (55 of 72 remaining) [2025-03-08 22:04:29,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (54 of 72 remaining) [2025-03-08 22:04:29,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (53 of 72 remaining) [2025-03-08 22:04:29,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (52 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (51 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (50 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (49 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (48 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (47 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (46 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (45 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (44 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (43 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (42 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (41 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (40 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (39 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (30 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 72 remaining) [2025-03-08 22:04:29,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (27 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (26 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (25 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (24 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (23 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (21 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (20 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (19 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (18 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (17 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (16 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (15 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (14 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (13 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (11 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 72 remaining) [2025-03-08 22:04:29,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 72 remaining) [2025-03-08 22:04:29,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 22:04:29,562 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:29,566 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 22:04:29,566 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:04:29,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:04:29 BasicIcfg [2025-03-08 22:04:29,571 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:04:29,571 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:04:29,571 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:04:29,571 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:04:29,572 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:04:18" (3/4) ... [2025-03-08 22:04:29,573 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:04:29,575 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-08 22:04:29,575 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-08 22:04:29,580 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-03-08 22:04:29,580 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 22:04:29,580 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 22:04:29,581 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:04:29,646 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:04:29,646 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:04:29,646 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:04:29,648 INFO L158 Benchmark]: Toolchain (without parser) took 11949.80ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 111.5MB in the beginning and 370.3MB in the end (delta: -258.9MB). Peak memory consumption was 135.2MB. Max. memory is 16.1GB. [2025-03-08 22:04:29,648 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:04:29,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.72ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 98.1MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:04:29,649 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.03ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 95.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:04:29,649 INFO L158 Benchmark]: Boogie Preprocessor took 26.84ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 92.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:04:29,650 INFO L158 Benchmark]: IcfgBuilder took 705.05ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 58.3MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 22:04:29,650 INFO L158 Benchmark]: TraceAbstraction took 10911.51ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 57.9MB in the beginning and 378.7MB in the end (delta: -320.8MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. [2025-03-08 22:04:29,650 INFO L158 Benchmark]: Witness Printer took 75.57ms. Allocated memory is still 536.9MB. Free memory was 378.7MB in the beginning and 370.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:04:29,651 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.72ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 98.1MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.03ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 95.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.84ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 92.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 705.05ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 58.3MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10911.51ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 57.9MB in the beginning and 378.7MB in the end (delta: -320.8MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. * Witness Printer took 75.57ms. Allocated memory is still 536.9MB. Free memory was 378.7MB in the beginning and 370.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 656 locations, 691 edges, 72 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.7s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3619 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2305 mSDsluCounter, 3739 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3297 mSDsCounter, 606 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5667 IncrementalHoareTripleChecker+Invalid, 6273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 606 mSolverCounterUnsat, 442 mSDtfsCounter, 5667 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1200occurred in iteration=16, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 3156 NumberOfCodeBlocks, 3156 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3131 ConstructedInterpolants, 0 QuantifiedInterpolants, 4556 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 23/23 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 42 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 22:04:29,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE