./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/fib_unsafe-7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/fib_unsafe-7.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7399a2144dae504b22d3bd9a68ebd91d200de1e145cd9c7db720353ffec7d306 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:22:41,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:22:41,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:22:41,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:22:41,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:22:41,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:22:41,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:22:41,427 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:22:41,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:22:41,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:22:41,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:22:41,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:22:41,429 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:22:41,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:22:41,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:22:41,429 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:22:41,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:22:41,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:22:41,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:22:41,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:22:41,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:22:41,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:22:41,429 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:22:41,429 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:22:41,429 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:22:41,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:22:41,430 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:22:41,430 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:22:41,430 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:22:41,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:22:41,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:22:41,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:22:41,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:22:41,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:22:41,430 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:22:41,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:22:41,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:22:41,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:22:41,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:22:41,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:22:41,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:22:41,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:22:41,430 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 -> 7399a2144dae504b22d3bd9a68ebd91d200de1e145cd9c7db720353ffec7d306 [2025-03-04 06:22:41,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:22:41,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:22:41,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:22:41,703 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:22:41,703 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:22:41,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_unsafe-7.i [2025-03-04 06:22:42,867 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c399aa45/da09110a11484fd993201144723a556f/FLAG150bc9ad4 [2025-03-04 06:22:43,207 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:22:43,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-7.i [2025-03-04 06:22:43,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c399aa45/da09110a11484fd993201144723a556f/FLAG150bc9ad4 [2025-03-04 06:22:43,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c399aa45/da09110a11484fd993201144723a556f [2025-03-04 06:22:43,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:22:43,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:22:43,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:22:43,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:22:43,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:22:43,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:22:43" (1/1) ... [2025-03-04 06:22:43,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f5a546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:43, skipping insertion in model container [2025-03-04 06:22:43,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:22:43" (1/1) ... [2025-03-04 06:22:43,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:22:43,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:22:43,683 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:22:43,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:22:43,754 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:22:43,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:43 WrapperNode [2025-03-04 06:22:43,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:22:43,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:22:43,756 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:22:43,756 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:22:43,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:43" (1/1) ... [2025-03-04 06:22:43,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:43" (1/1) ... [2025-03-04 06:22:43,782 INFO L138 Inliner]: procedures = 164, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2025-03-04 06:22:43,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:22:43,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:22:43,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:22:43,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:22:43,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:43" (1/1) ... [2025-03-04 06:22:43,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:43" (1/1) ... [2025-03-04 06:22:43,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:43" (1/1) ... [2025-03-04 06:22:43,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:43" (1/1) ... [2025-03-04 06:22:43,800 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:43" (1/1) ... [2025-03-04 06:22:43,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:43" (1/1) ... [2025-03-04 06:22:43,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:43" (1/1) ... [2025-03-04 06:22:43,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:43" (1/1) ... [2025-03-04 06:22:43,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:22:43,805 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:22:43,805 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:22:43,805 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:22:43,806 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:43" (1/1) ... [2025-03-04 06:22:43,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:22:43,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:22:43,835 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-04 06:22:43,841 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-04 06:22:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 06:22:43,858 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 06:22:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 06:22:43,858 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 06:22:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:22:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:22:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:22:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:22:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:22:43,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:22:43,859 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:22:43,945 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:22:43,947 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:22:44,160 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:22:44,160 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:22:44,234 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:22:44,234 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:22:44,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:22:44 BoogieIcfgContainer [2025-03-04 06:22:44,234 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:22:44,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:22:44,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:22:44,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:22:44,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:22:43" (1/3) ... [2025-03-04 06:22:44,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35db30c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:22:44, skipping insertion in model container [2025-03-04 06:22:44,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:43" (2/3) ... [2025-03-04 06:22:44,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35db30c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:22:44, skipping insertion in model container [2025-03-04 06:22:44,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:22:44" (3/3) ... [2025-03-04 06:22:44,243 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-7.i [2025-03-04 06:22:44,254 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:22:44,255 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_unsafe-7.i that has 3 procedures, 176 locations, 1 initial locations, 3 loop locations, and 30 error locations. [2025-03-04 06:22:44,256 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:22:44,299 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:22:44,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 183 transitions, 374 flow [2025-03-04 06:22:44,395 INFO L124 PetriNetUnfolderBase]: 8/181 cut-off events. [2025-03-04 06:22:44,397 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:44,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 8/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 373 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 155. Up to 2 conditions per place. [2025-03-04 06:22:44,405 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 183 transitions, 374 flow [2025-03-04 06:22:44,409 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 181 transitions, 368 flow [2025-03-04 06:22:44,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:22:44,427 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;@3fa50f7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:22:44,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-03-04 06:22:44,432 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:22:44,433 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-04 06:22:44,433 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:44,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:44,434 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] [2025-03-04 06:22:44,434 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:22:44,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:44,439 INFO L85 PathProgramCache]: Analyzing trace with hash 34642534, now seen corresponding path program 1 times [2025-03-04 06:22:44,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:44,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560483056] [2025-03-04 06:22:44,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:44,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:44,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 06:22:44,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 06:22:44,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:44,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:44,598 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-04 06:22:44,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:44,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560483056] [2025-03-04 06:22:44,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560483056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:44,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:44,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 06:22:44,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121696117] [2025-03-04 06:22:44,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:44,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:22:44,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:44,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:22:44,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:22:44,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 183 [2025-03-04 06:22:44,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 181 transitions, 368 flow. Second operand has 2 states, 2 states have (on average 160.5) internal successors, (321), 2 states have internal predecessors, (321), 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-04 06:22:44,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:44,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 183 [2025-03-04 06:22:44,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:44,742 INFO L124 PetriNetUnfolderBase]: 13/317 cut-off events. [2025-03-04 06:22:44,743 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:22:44,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 317 events. 13/317 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1162 event pairs, 6 based on Foata normal form. 23/286 useless extension candidates. Maximal degree in co-relation 312. Up to 21 conditions per place. [2025-03-04 06:22:44,748 INFO L140 encePairwiseOnDemand]: 168/183 looper letters, 7 selfloop transitions, 0 changer transitions 0/164 dead transitions. [2025-03-04 06:22:44,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 164 transitions, 348 flow [2025-03-04 06:22:44,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:22:44,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 06:22:44,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 342 transitions. [2025-03-04 06:22:44,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9344262295081968 [2025-03-04 06:22:44,765 INFO L175 Difference]: Start difference. First operand has 180 places, 181 transitions, 368 flow. Second operand 2 states and 342 transitions. [2025-03-04 06:22:44,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 164 transitions, 348 flow [2025-03-04 06:22:44,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 164 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:22:44,773 INFO L231 Difference]: Finished difference. Result has 167 places, 164 transitions, 332 flow [2025-03-04 06:22:44,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=332, PETRI_PLACES=167, PETRI_TRANSITIONS=164} [2025-03-04 06:22:44,777 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -13 predicate places. [2025-03-04 06:22:44,777 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 164 transitions, 332 flow [2025-03-04 06:22:44,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 160.5) internal successors, (321), 2 states have internal predecessors, (321), 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-04 06:22:44,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:44,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:22:44,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:22:44,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:22:44,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:44,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1127263437, now seen corresponding path program 1 times [2025-03-04 06:22:44,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:44,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841355316] [2025-03-04 06:22:44,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:44,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:44,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 06:22:44,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 06:22:44,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:44,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:44,858 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-04 06:22:44,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:44,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841355316] [2025-03-04 06:22:44,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841355316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:44,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:44,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:44,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740400188] [2025-03-04 06:22:44,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:44,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:44,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:44,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:44,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:44,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-03-04 06:22:44,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 164 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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-04 06:22:44,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:44,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-03-04 06:22:44,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:44,978 INFO L124 PetriNetUnfolderBase]: 63/594 cut-off events. [2025-03-04 06:22:44,978 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:44,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 594 events. 63/594 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3283 event pairs, 29 based on Foata normal form. 0/474 useless extension candidates. Maximal degree in co-relation 716. Up to 81 conditions per place. [2025-03-04 06:22:44,986 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 15 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-03-04 06:22:44,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 166 transitions, 372 flow [2025-03-04 06:22:44,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:44,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-03-04 06:22:44,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8633879781420765 [2025-03-04 06:22:44,992 INFO L175 Difference]: Start difference. First operand has 167 places, 164 transitions, 332 flow. Second operand 3 states and 474 transitions. [2025-03-04 06:22:44,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 166 transitions, 372 flow [2025-03-04 06:22:44,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 166 transitions, 372 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:22:44,997 INFO L231 Difference]: Finished difference. Result has 168 places, 163 transitions, 334 flow [2025-03-04 06:22:44,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=168, PETRI_TRANSITIONS=163} [2025-03-04 06:22:44,998 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -12 predicate places. [2025-03-04 06:22:44,998 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 163 transitions, 334 flow [2025-03-04 06:22:44,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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-04 06:22:44,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:44,999 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-04 06:22:44,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:22:44,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:22:45,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:45,001 INFO L85 PathProgramCache]: Analyzing trace with hash 44660795, now seen corresponding path program 1 times [2025-03-04 06:22:45,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:45,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451479997] [2025-03-04 06:22:45,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:45,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:45,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 06:22:45,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 06:22:45,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:45,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:22:45,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:45,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451479997] [2025-03-04 06:22:45,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451479997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:45,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:45,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:45,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828114876] [2025-03-04 06:22:45,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:45,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:45,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:45,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:45,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:45,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-03-04 06:22:45,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 163 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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-04 06:22:45,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:45,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-03-04 06:22:45,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:45,125 INFO L124 PetriNetUnfolderBase]: 50/334 cut-off events. [2025-03-04 06:22:45,125 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 06:22:45,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 334 events. 50/334 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1527 event pairs, 11 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 447. Up to 55 conditions per place. [2025-03-04 06:22:45,128 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 14 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2025-03-04 06:22:45,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 370 flow [2025-03-04 06:22:45,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:45,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-03-04 06:22:45,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8633879781420765 [2025-03-04 06:22:45,132 INFO L175 Difference]: Start difference. First operand has 168 places, 163 transitions, 334 flow. Second operand 3 states and 474 transitions. [2025-03-04 06:22:45,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 370 flow [2025-03-04 06:22:45,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:22:45,134 INFO L231 Difference]: Finished difference. Result has 166 places, 161 transitions, 330 flow [2025-03-04 06:22:45,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=166, PETRI_TRANSITIONS=161} [2025-03-04 06:22:45,135 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -14 predicate places. [2025-03-04 06:22:45,135 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 161 transitions, 330 flow [2025-03-04 06:22:45,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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-04 06:22:45,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:45,135 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] [2025-03-04 06:22:45,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:22:45,138 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:22:45,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:45,139 INFO L85 PathProgramCache]: Analyzing trace with hash -979585613, now seen corresponding path program 1 times [2025-03-04 06:22:45,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:45,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819024597] [2025-03-04 06:22:45,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:45,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:45,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 06:22:45,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 06:22:45,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:45,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:45,197 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-04 06:22:45,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:45,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819024597] [2025-03-04 06:22:45,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819024597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:45,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:45,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:45,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906979523] [2025-03-04 06:22:45,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:45,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:45,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:45,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:45,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:45,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-03-04 06:22:45,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 161 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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-04 06:22:45,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:45,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-03-04 06:22:45,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:45,278 INFO L124 PetriNetUnfolderBase]: 41/346 cut-off events. [2025-03-04 06:22:45,278 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:45,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 346 events. 41/346 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1665 event pairs, 26 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 428. Up to 59 conditions per place. [2025-03-04 06:22:45,281 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 14 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2025-03-04 06:22:45,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 162 transitions, 364 flow [2025-03-04 06:22:45,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:45,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-03-04 06:22:45,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-03-04 06:22:45,283 INFO L175 Difference]: Start difference. First operand has 166 places, 161 transitions, 330 flow. Second operand 3 states and 473 transitions. [2025-03-04 06:22:45,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 162 transitions, 364 flow [2025-03-04 06:22:45,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 162 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:22:45,286 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 328 flow [2025-03-04 06:22:45,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=165, PETRI_TRANSITIONS=160} [2025-03-04 06:22:45,287 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -15 predicate places. [2025-03-04 06:22:45,287 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 328 flow [2025-03-04 06:22:45,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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-04 06:22:45,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:45,288 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] [2025-03-04 06:22:45,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:22:45,289 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:22:45,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:45,290 INFO L85 PathProgramCache]: Analyzing trace with hash 537829956, now seen corresponding path program 1 times [2025-03-04 06:22:45,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:45,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126717350] [2025-03-04 06:22:45,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:45,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:45,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 06:22:45,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 06:22:45,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:45,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:45,336 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-04 06:22:45,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:45,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126717350] [2025-03-04 06:22:45,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126717350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:45,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:45,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:45,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054734458] [2025-03-04 06:22:45,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:45,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:45,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:45,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:45,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:45,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2025-03-04 06:22:45,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 160 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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-04 06:22:45,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:45,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2025-03-04 06:22:45,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:45,426 INFO L124 PetriNetUnfolderBase]: 65/510 cut-off events. [2025-03-04 06:22:45,426 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:45,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 510 events. 65/510 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2802 event pairs, 24 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 626. Up to 87 conditions per place. [2025-03-04 06:22:45,430 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 16 selfloop transitions, 2 changer transitions 0/161 dead transitions. [2025-03-04 06:22:45,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 161 transitions, 366 flow [2025-03-04 06:22:45,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:45,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2025-03-04 06:22:45,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8542805100182149 [2025-03-04 06:22:45,432 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 328 flow. Second operand 3 states and 469 transitions. [2025-03-04 06:22:45,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 161 transitions, 366 flow [2025-03-04 06:22:45,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 161 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:22:45,434 INFO L231 Difference]: Finished difference. Result has 164 places, 159 transitions, 326 flow [2025-03-04 06:22:45,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=164, PETRI_TRANSITIONS=159} [2025-03-04 06:22:45,437 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -16 predicate places. [2025-03-04 06:22:45,439 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 159 transitions, 326 flow [2025-03-04 06:22:45,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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-04 06:22:45,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:45,439 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] [2025-03-04 06:22:45,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:22:45,439 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:22:45,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:45,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1468234265, now seen corresponding path program 1 times [2025-03-04 06:22:45,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:45,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694944135] [2025-03-04 06:22:45,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:45,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:45,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 06:22:45,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 06:22:45,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:45,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:45,487 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-04 06:22:45,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:45,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694944135] [2025-03-04 06:22:45,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694944135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:45,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:45,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:45,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635631305] [2025-03-04 06:22:45,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:45,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:45,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:45,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:45,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:45,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-03-04 06:22:45,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 159 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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-04 06:22:45,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:45,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-03-04 06:22:45,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:45,545 INFO L124 PetriNetUnfolderBase]: 37/358 cut-off events. [2025-03-04 06:22:45,545 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:45,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 358 events. 37/358 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1741 event pairs, 16 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 434. Up to 40 conditions per place. [2025-03-04 06:22:45,548 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 13 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2025-03-04 06:22:45,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 159 transitions, 356 flow [2025-03-04 06:22:45,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:45,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:45,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-03-04 06:22:45,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-03-04 06:22:45,550 INFO L175 Difference]: Start difference. First operand has 164 places, 159 transitions, 326 flow. Second operand 3 states and 473 transitions. [2025-03-04 06:22:45,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 159 transitions, 356 flow [2025-03-04 06:22:45,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 159 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:22:45,551 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 322 flow [2025-03-04 06:22:45,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=162, PETRI_TRANSITIONS=157} [2025-03-04 06:22:45,552 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -18 predicate places. [2025-03-04 06:22:45,552 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 322 flow [2025-03-04 06:22:45,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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-04 06:22:45,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:45,553 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:22:45,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:22:45,553 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:22:45,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:45,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1198535268, now seen corresponding path program 1 times [2025-03-04 06:22:45,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:45,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874441147] [2025-03-04 06:22:45,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:45,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:45,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:22:45,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:22:45,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:45,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:45,606 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-04 06:22:45,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:45,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874441147] [2025-03-04 06:22:45,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874441147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:45,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:45,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:45,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268940191] [2025-03-04 06:22:45,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:45,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:45,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:45,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:45,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:45,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-03-04 06:22:45,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 157 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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-04 06:22:45,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:45,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-03-04 06:22:45,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:45,676 INFO L124 PetriNetUnfolderBase]: 49/403 cut-off events. [2025-03-04 06:22:45,676 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:45,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 403 events. 49/403 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1951 event pairs, 28 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 525. Up to 71 conditions per place. [2025-03-04 06:22:45,679 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 15 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2025-03-04 06:22:45,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 159 transitions, 362 flow [2025-03-04 06:22:45,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:45,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-03-04 06:22:45,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8633879781420765 [2025-03-04 06:22:45,682 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 322 flow. Second operand 3 states and 474 transitions. [2025-03-04 06:22:45,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 159 transitions, 362 flow [2025-03-04 06:22:45,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 159 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:22:45,684 INFO L231 Difference]: Finished difference. Result has 161 places, 156 transitions, 320 flow [2025-03-04 06:22:45,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=320, PETRI_PLACES=161, PETRI_TRANSITIONS=156} [2025-03-04 06:22:45,684 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -19 predicate places. [2025-03-04 06:22:45,686 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 156 transitions, 320 flow [2025-03-04 06:22:45,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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-04 06:22:45,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:45,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:22:45,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:22:45,687 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:22:45,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:45,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2030355302, now seen corresponding path program 1 times [2025-03-04 06:22:45,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:45,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564747081] [2025-03-04 06:22:45,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:45,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:45,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:22:45,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:22:45,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:45,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:45,723 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-04 06:22:45,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:45,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564747081] [2025-03-04 06:22:45,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564747081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:45,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:45,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:45,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191002442] [2025-03-04 06:22:45,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:45,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:45,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:45,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:45,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:45,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-03-04 06:22:45,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 156 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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-04 06:22:45,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:45,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-03-04 06:22:45,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:45,801 INFO L124 PetriNetUnfolderBase]: 37/427 cut-off events. [2025-03-04 06:22:45,801 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:45,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 427 events. 37/427 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2066 event pairs, 10 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 501. Up to 40 conditions per place. [2025-03-04 06:22:45,805 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 13 selfloop transitions, 2 changer transitions 0/156 dead transitions. [2025-03-04 06:22:45,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 156 transitions, 350 flow [2025-03-04 06:22:45,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:45,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:45,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-03-04 06:22:45,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-03-04 06:22:45,807 INFO L175 Difference]: Start difference. First operand has 161 places, 156 transitions, 320 flow. Second operand 3 states and 473 transitions. [2025-03-04 06:22:45,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 156 transitions, 350 flow [2025-03-04 06:22:45,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 156 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:22:45,809 INFO L231 Difference]: Finished difference. Result has 159 places, 154 transitions, 316 flow [2025-03-04 06:22:45,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=159, PETRI_TRANSITIONS=154} [2025-03-04 06:22:45,811 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -21 predicate places. [2025-03-04 06:22:45,811 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 154 transitions, 316 flow [2025-03-04 06:22:45,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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-04 06:22:45,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:45,811 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:22:45,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:22:45,812 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:22:45,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:45,812 INFO L85 PathProgramCache]: Analyzing trace with hash -290113610, now seen corresponding path program 1 times [2025-03-04 06:22:45,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:45,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71072468] [2025-03-04 06:22:45,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:45,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:45,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 06:22:45,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 06:22:45,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:45,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:45,856 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-04 06:22:45,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:45,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71072468] [2025-03-04 06:22:45,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71072468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:45,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:45,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:22:45,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637683804] [2025-03-04 06:22:45,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:45,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:45,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:45,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:45,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:45,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 183 [2025-03-04 06:22:45,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 154 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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-04 06:22:45,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:45,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 183 [2025-03-04 06:22:45,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:45,921 INFO L124 PetriNetUnfolderBase]: 25/567 cut-off events. [2025-03-04 06:22:45,921 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:45,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 567 events. 25/567 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2468 event pairs, 6 based on Foata normal form. 4/495 useless extension candidates. Maximal degree in co-relation 632. Up to 29 conditions per place. [2025-03-04 06:22:45,925 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 12 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-03-04 06:22:45,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 350 flow [2025-03-04 06:22:45,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2025-03-04 06:22:45,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8797814207650273 [2025-03-04 06:22:45,926 INFO L175 Difference]: Start difference. First operand has 159 places, 154 transitions, 316 flow. Second operand 3 states and 483 transitions. [2025-03-04 06:22:45,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 350 flow [2025-03-04 06:22:45,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:22:45,929 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 324 flow [2025-03-04 06:22:45,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=160, PETRI_TRANSITIONS=155} [2025-03-04 06:22:45,930 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -20 predicate places. [2025-03-04 06:22:45,930 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 324 flow [2025-03-04 06:22:45,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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-04 06:22:45,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:45,931 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] [2025-03-04 06:22:45,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:22:45,931 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:22:45,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:45,932 INFO L85 PathProgramCache]: Analyzing trace with hash -290112787, now seen corresponding path program 1 times [2025-03-04 06:22:45,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:45,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541984074] [2025-03-04 06:22:45,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:45,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:45,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 06:22:45,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 06:22:45,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:45,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:45,965 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-04 06:22:45,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:45,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541984074] [2025-03-04 06:22:45,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541984074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:45,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:45,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:45,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562029658] [2025-03-04 06:22:45,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:45,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:45,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:45,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:45,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:45,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 183 [2025-03-04 06:22:45,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 155 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-04 06:22:45,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:45,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 183 [2025-03-04 06:22:45,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:46,031 INFO L124 PetriNetUnfolderBase]: 57/553 cut-off events. [2025-03-04 06:22:46,032 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:22:46,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 553 events. 57/553 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2417 event pairs, 10 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 664. Up to 66 conditions per place. [2025-03-04 06:22:46,034 INFO L140 encePairwiseOnDemand]: 178/183 looper letters, 11 selfloop transitions, 3 changer transitions 0/155 dead transitions. [2025-03-04 06:22:46,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 155 transitions, 352 flow [2025-03-04 06:22:46,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:46,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-03-04 06:22:46,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8652094717668488 [2025-03-04 06:22:46,036 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 324 flow. Second operand 3 states and 475 transitions. [2025-03-04 06:22:46,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 155 transitions, 352 flow [2025-03-04 06:22:46,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 155 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:22:46,038 INFO L231 Difference]: Finished difference. Result has 159 places, 153 transitions, 324 flow [2025-03-04 06:22:46,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=159, PETRI_TRANSITIONS=153} [2025-03-04 06:22:46,039 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -21 predicate places. [2025-03-04 06:22:46,040 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 153 transitions, 324 flow [2025-03-04 06:22:46,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-04 06:22:46,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:46,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:22:46,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:22:46,040 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:22:46,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:46,041 INFO L85 PathProgramCache]: Analyzing trace with hash 374494858, now seen corresponding path program 1 times [2025-03-04 06:22:46,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:46,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920677466] [2025-03-04 06:22:46,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:46,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:46,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 06:22:46,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 06:22:46,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:46,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:46,066 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-04 06:22:46,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:46,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920677466] [2025-03-04 06:22:46,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920677466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:46,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:46,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:46,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364781617] [2025-03-04 06:22:46,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:46,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:46,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:46,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:46,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:46,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 183 [2025-03-04 06:22:46,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 153 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-04 06:22:46,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:46,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 183 [2025-03-04 06:22:46,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:46,127 INFO L124 PetriNetUnfolderBase]: 65/561 cut-off events. [2025-03-04 06:22:46,127 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:46,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 561 events. 65/561 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2490 event pairs, 14 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 700. Up to 72 conditions per place. [2025-03-04 06:22:46,131 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 12 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2025-03-04 06:22:46,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 153 transitions, 352 flow [2025-03-04 06:22:46,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:46,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:46,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-03-04 06:22:46,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8652094717668488 [2025-03-04 06:22:46,133 INFO L175 Difference]: Start difference. First operand has 159 places, 153 transitions, 324 flow. Second operand 3 states and 475 transitions. [2025-03-04 06:22:46,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 153 transitions, 352 flow [2025-03-04 06:22:46,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 153 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:22:46,135 INFO L231 Difference]: Finished difference. Result has 157 places, 151 transitions, 318 flow [2025-03-04 06:22:46,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=157, PETRI_TRANSITIONS=151} [2025-03-04 06:22:46,136 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -23 predicate places. [2025-03-04 06:22:46,136 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 151 transitions, 318 flow [2025-03-04 06:22:46,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-04 06:22:46,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:46,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:22:46,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:22:46,137 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:22:46,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:46,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1314944668, now seen corresponding path program 1 times [2025-03-04 06:22:46,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:46,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054534418] [2025-03-04 06:22:46,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:46,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:46,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 06:22:46,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 06:22:46,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:46,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:46,165 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-04 06:22:46,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:46,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054534418] [2025-03-04 06:22:46,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054534418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:46,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:46,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:46,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23676226] [2025-03-04 06:22:46,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:46,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:46,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:46,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:46,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:46,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-03-04 06:22:46,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 151 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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-04 06:22:46,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:46,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-03-04 06:22:46,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:46,238 INFO L124 PetriNetUnfolderBase]: 37/409 cut-off events. [2025-03-04 06:22:46,238 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:46,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 409 events. 37/409 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1535 event pairs, 24 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 500. Up to 55 conditions per place. [2025-03-04 06:22:46,241 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 14 selfloop transitions, 2 changer transitions 0/152 dead transitions. [2025-03-04 06:22:46,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 152 transitions, 352 flow [2025-03-04 06:22:46,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:46,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-03-04 06:22:46,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-03-04 06:22:46,242 INFO L175 Difference]: Start difference. First operand has 157 places, 151 transitions, 318 flow. Second operand 3 states and 473 transitions. [2025-03-04 06:22:46,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 152 transitions, 352 flow [2025-03-04 06:22:46,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 152 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:22:46,245 INFO L231 Difference]: Finished difference. Result has 156 places, 150 transitions, 316 flow [2025-03-04 06:22:46,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=156, PETRI_TRANSITIONS=150} [2025-03-04 06:22:46,246 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -24 predicate places. [2025-03-04 06:22:46,246 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 150 transitions, 316 flow [2025-03-04 06:22:46,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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-04 06:22:46,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:46,247 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] [2025-03-04 06:22:46,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:22:46,247 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:22:46,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:46,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1634374500, now seen corresponding path program 1 times [2025-03-04 06:22:46,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:46,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488094921] [2025-03-04 06:22:46,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:46,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:46,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:22:46,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:22:46,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:46,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:46,276 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-04 06:22:46,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:46,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488094921] [2025-03-04 06:22:46,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488094921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:46,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:46,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:46,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423836378] [2025-03-04 06:22:46,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:46,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:46,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:46,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:46,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:46,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-03-04 06:22:46,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 150 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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-04 06:22:46,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:46,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-03-04 06:22:46,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:46,342 INFO L124 PetriNetUnfolderBase]: 61/567 cut-off events. [2025-03-04 06:22:46,342 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:46,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 567 events. 61/567 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2719 event pairs, 38 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 704. Up to 83 conditions per place. [2025-03-04 06:22:46,346 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 14 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2025-03-04 06:22:46,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 151 transitions, 350 flow [2025-03-04 06:22:46,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:46,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:46,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-03-04 06:22:46,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-03-04 06:22:46,348 INFO L175 Difference]: Start difference. First operand has 156 places, 150 transitions, 316 flow. Second operand 3 states and 473 transitions. [2025-03-04 06:22:46,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 151 transitions, 350 flow [2025-03-04 06:22:46,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 151 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:22:46,350 INFO L231 Difference]: Finished difference. Result has 155 places, 149 transitions, 314 flow [2025-03-04 06:22:46,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=155, PETRI_TRANSITIONS=149} [2025-03-04 06:22:46,350 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -25 predicate places. [2025-03-04 06:22:46,350 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 149 transitions, 314 flow [2025-03-04 06:22:46,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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-04 06:22:46,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:46,351 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:22:46,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:22:46,351 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:22:46,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:46,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2031917957, now seen corresponding path program 1 times [2025-03-04 06:22:46,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:46,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686553217] [2025-03-04 06:22:46,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:46,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:46,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 06:22:46,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 06:22:46,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:46,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:46,388 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-04 06:22:46,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:46,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686553217] [2025-03-04 06:22:46,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686553217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:46,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:46,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:46,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921592701] [2025-03-04 06:22:46,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:46,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:46,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:46,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:46,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:46,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2025-03-04 06:22:46,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 149 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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-04 06:22:46,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:46,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2025-03-04 06:22:46,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:46,453 INFO L124 PetriNetUnfolderBase]: 65/563 cut-off events. [2025-03-04 06:22:46,454 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:46,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 563 events. 65/563 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2784 event pairs, 42 based on Foata normal form. 0/533 useless extension candidates. Maximal degree in co-relation 720. Up to 91 conditions per place. [2025-03-04 06:22:46,456 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 15 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2025-03-04 06:22:46,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 150 transitions, 350 flow [2025-03-04 06:22:46,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-03-04 06:22:46,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8579234972677595 [2025-03-04 06:22:46,458 INFO L175 Difference]: Start difference. First operand has 155 places, 149 transitions, 314 flow. Second operand 3 states and 471 transitions. [2025-03-04 06:22:46,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 150 transitions, 350 flow [2025-03-04 06:22:46,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 150 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:22:46,460 INFO L231 Difference]: Finished difference. Result has 154 places, 148 transitions, 312 flow [2025-03-04 06:22:46,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=154, PETRI_TRANSITIONS=148} [2025-03-04 06:22:46,461 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -26 predicate places. [2025-03-04 06:22:46,461 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 148 transitions, 312 flow [2025-03-04 06:22:46,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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-04 06:22:46,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:46,461 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] [2025-03-04 06:22:46,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:22:46,461 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:22:46,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:46,462 INFO L85 PathProgramCache]: Analyzing trace with hash 401536390, now seen corresponding path program 1 times [2025-03-04 06:22:46,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:46,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392285439] [2025-03-04 06:22:46,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:46,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:46,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 06:22:46,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 06:22:46,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:46,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:46,488 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-04 06:22:46,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:46,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392285439] [2025-03-04 06:22:46,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392285439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:46,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:46,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:46,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749359866] [2025-03-04 06:22:46,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:46,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:46,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:46,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:46,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:46,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 183 [2025-03-04 06:22:46,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 148 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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-04 06:22:46,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:46,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 183 [2025-03-04 06:22:46,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:46,541 INFO L124 PetriNetUnfolderBase]: 51/535 cut-off events. [2025-03-04 06:22:46,541 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:46,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 535 events. 51/535 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2309 event pairs, 10 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 642. Up to 50 conditions per place. [2025-03-04 06:22:46,543 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 11 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2025-03-04 06:22:46,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 150 transitions, 342 flow [2025-03-04 06:22:46,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2025-03-04 06:22:46,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8779599271402551 [2025-03-04 06:22:46,545 INFO L175 Difference]: Start difference. First operand has 154 places, 148 transitions, 312 flow. Second operand 3 states and 482 transitions. [2025-03-04 06:22:46,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 150 transitions, 342 flow [2025-03-04 06:22:46,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 150 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:22:46,547 INFO L231 Difference]: Finished difference. Result has 154 places, 148 transitions, 316 flow [2025-03-04 06:22:46,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=154, PETRI_TRANSITIONS=148} [2025-03-04 06:22:46,548 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -26 predicate places. [2025-03-04 06:22:46,548 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 148 transitions, 316 flow [2025-03-04 06:22:46,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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-04 06:22:46,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:46,548 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] [2025-03-04 06:22:46,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:22:46,548 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:22:46,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:46,549 INFO L85 PathProgramCache]: Analyzing trace with hash -179450328, now seen corresponding path program 1 times [2025-03-04 06:22:46,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:46,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812768934] [2025-03-04 06:22:46,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:46,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:46,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 06:22:46,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 06:22:46,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:46,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:46,586 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-04 06:22:46,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:46,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812768934] [2025-03-04 06:22:46,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812768934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:46,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:46,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:46,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755692380] [2025-03-04 06:22:46,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:46,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:46,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:46,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:46,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:46,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2025-03-04 06:22:46,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 148 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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-04 06:22:46,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:46,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2025-03-04 06:22:46,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:46,660 INFO L124 PetriNetUnfolderBase]: 69/551 cut-off events. [2025-03-04 06:22:46,660 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 06:22:46,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 551 events. 69/551 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2743 event pairs, 46 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 720. Up to 99 conditions per place. [2025-03-04 06:22:46,663 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 15 selfloop transitions, 2 changer transitions 0/149 dead transitions. [2025-03-04 06:22:46,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 149 transitions, 352 flow [2025-03-04 06:22:46,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:46,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-03-04 06:22:46,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8579234972677595 [2025-03-04 06:22:46,665 INFO L175 Difference]: Start difference. First operand has 154 places, 148 transitions, 316 flow. Second operand 3 states and 471 transitions. [2025-03-04 06:22:46,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 149 transitions, 352 flow [2025-03-04 06:22:46,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 149 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:22:46,667 INFO L231 Difference]: Finished difference. Result has 154 places, 147 transitions, 316 flow [2025-03-04 06:22:46,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=154, PETRI_TRANSITIONS=147} [2025-03-04 06:22:46,667 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -26 predicate places. [2025-03-04 06:22:46,667 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 147 transitions, 316 flow [2025-03-04 06:22:46,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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-04 06:22:46,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:46,668 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:22:46,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:22:46,668 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-04 06:22:46,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:46,668 INFO L85 PathProgramCache]: Analyzing trace with hash 281682885, now seen corresponding path program 1 times [2025-03-04 06:22:46,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:46,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049032422] [2025-03-04 06:22:46,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:46,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:46,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 06:22:46,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 06:22:46,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:46,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:46,692 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-04 06:22:46,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:46,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049032422] [2025-03-04 06:22:46,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049032422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:46,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:46,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:46,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286563135] [2025-03-04 06:22:46,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:46,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:46,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:46,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:46,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:46,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2025-03-04 06:22:46,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 147 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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-04 06:22:46,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:46,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2025-03-04 06:22:46,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:46,754 INFO L124 PetriNetUnfolderBase]: 57/535 cut-off events. [2025-03-04 06:22:46,754 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:46,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 535 events. 57/535 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2425 event pairs, 42 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 692. Up to 91 conditions per place. [2025-03-04 06:22:46,757 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 0 selfloop transitions, 0 changer transitions 148/148 dead transitions. [2025-03-04 06:22:46,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 148 transitions, 354 flow [2025-03-04 06:22:46,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:46,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2025-03-04 06:22:46,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8542805100182149 [2025-03-04 06:22:46,758 INFO L175 Difference]: Start difference. First operand has 154 places, 147 transitions, 316 flow. Second operand 3 states and 469 transitions. [2025-03-04 06:22:46,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 148 transitions, 354 flow [2025-03-04 06:22:46,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 148 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:22:46,759 INFO L231 Difference]: Finished difference. Result has 153 places, 0 transitions, 0 flow [2025-03-04 06:22:46,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=153, PETRI_TRANSITIONS=0} [2025-03-04 06:22:46,760 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -27 predicate places. [2025-03-04 06:22:46,760 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 0 transitions, 0 flow [2025-03-04 06:22:46,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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-04 06:22:46,762 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2025-03-04 06:22:46,762 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2025-03-04 06:22:46,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2025-03-04 06:22:46,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2025-03-04 06:22:46,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2025-03-04 06:22:46,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2025-03-04 06:22:46,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2025-03-04 06:22:46,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2025-03-04 06:22:46,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2025-03-04 06:22:46,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2025-03-04 06:22:46,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2025-03-04 06:22:46,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2025-03-04 06:22:46,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2025-03-04 06:22:46,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2025-03-04 06:22:46,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2025-03-04 06:22:46,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2025-03-04 06:22:46,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2025-03-04 06:22:46,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2025-03-04 06:22:46,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2025-03-04 06:22:46,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2025-03-04 06:22:46,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2025-03-04 06:22:46,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2025-03-04 06:22:46,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2025-03-04 06:22:46,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2025-03-04 06:22:46,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2025-03-04 06:22:46,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2025-03-04 06:22:46,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2025-03-04 06:22:46,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2025-03-04 06:22:46,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2025-03-04 06:22:46,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2025-03-04 06:22:46,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2025-03-04 06:22:46,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2025-03-04 06:22:46,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2025-03-04 06:22:46,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2025-03-04 06:22:46,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2025-03-04 06:22:46,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2025-03-04 06:22:46,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2025-03-04 06:22:46,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2025-03-04 06:22:46,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2025-03-04 06:22:46,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2025-03-04 06:22:46,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2025-03-04 06:22:46,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2025-03-04 06:22:46,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2025-03-04 06:22:46,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2025-03-04 06:22:46,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2025-03-04 06:22:46,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2025-03-04 06:22:46,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:22:46,766 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:22:46,769 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:22:46,770 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:22:46,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:22:46 BasicIcfg [2025-03-04 06:22:46,773 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:22:46,774 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:22:46,774 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:22:46,775 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:22:46,775 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:22:44" (3/4) ... [2025-03-04 06:22:46,776 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:22:46,778 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-03-04 06:22:46,778 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-03-04 06:22:46,780 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 06:22:46,781 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 06:22:46,781 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 06:22:46,781 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:22:46,830 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:22:46,830 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:22:46,830 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:22:46,831 INFO L158 Benchmark]: Toolchain (without parser) took 3395.16ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 112.0MB in the beginning and 56.2MB in the end (delta: 55.8MB). Peak memory consumption was 90.6MB. Max. memory is 16.1GB. [2025-03-04 06:22:46,831 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:22:46,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.10ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 92.1MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 06:22:46,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.47ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 90.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:22:46,833 INFO L158 Benchmark]: Boogie Preprocessor took 21.09ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 89.4MB in the end (delta: 874.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:22:46,833 INFO L158 Benchmark]: IcfgBuilder took 429.72ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 64.2MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 06:22:46,834 INFO L158 Benchmark]: TraceAbstraction took 2535.88ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 63.8MB in the beginning and 62.8MB in the end (delta: 975.5kB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2025-03-04 06:22:46,834 INFO L158 Benchmark]: Witness Printer took 55.78ms. Allocated memory is still 176.2MB. Free memory was 62.8MB in the beginning and 56.2MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:22:46,835 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.20ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.10ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 92.1MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.47ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 90.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.09ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 89.4MB in the end (delta: 874.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 429.72ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 64.2MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2535.88ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 63.8MB in the beginning and 62.8MB in the end (delta: 975.5kB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. * Witness Printer took 55.78ms. Allocated memory is still 176.2MB. Free memory was 62.8MB in the beginning and 56.2MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 715]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 718]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 705]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 705]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 706]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 706]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 724]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 724]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 706]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 708]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 708]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 705]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 705]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 687]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 687]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 689]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 689]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 689]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 687]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 687]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: 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, 236 locations, 46 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: 2.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 328 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 514 IncrementalHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 51 mSDtfsCounter, 514 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=368occurred in iteration=0, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 791 NumberOfCodeBlocks, 791 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 774 ConstructedInterpolants, 0 QuantifiedInterpolants, 818 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 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 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:22:46,850 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