./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/fib_unsafe-6.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-6.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 854e371c98b43d805c328b457758892c4a501d7b326c2672c089850792494a4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:22:39,491 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:22:39,547 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:39,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:22:39,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:22:39,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:22:39,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:22:39,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:22:39,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:22:39,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:22:39,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:22:39,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:22:39,579 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:22:39,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:22:39,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:22:39,580 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:22:39,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:22:39,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:22:39,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:22:39,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:22:39,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:22:39,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:22:39,580 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:22:39,580 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:22:39,580 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:22:39,580 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:22:39,581 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:22:39,581 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:22:39,581 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:22:39,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:22:39,581 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:22:39,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:22:39,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:22:39,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:22:39,581 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:22:39,582 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:22:39,582 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:22:39,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:22:39,582 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:22:39,582 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:22:39,582 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:22:39,582 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:22:39,582 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 -> 854e371c98b43d805c328b457758892c4a501d7b326c2672c089850792494a4b [2025-03-04 06:22:39,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:22:39,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:22:39,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:22:39,800 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:22:39,800 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:22:39,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_unsafe-6.i [2025-03-04 06:22:41,607 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e48121963/1ca47d2188824cb1bc5673136927ef29/FLAGd12e1780f [2025-03-04 06:22:41,862 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:22:41,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-6.i [2025-03-04 06:22:41,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e48121963/1ca47d2188824cb1bc5673136927ef29/FLAGd12e1780f [2025-03-04 06:22:41,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e48121963/1ca47d2188824cb1bc5673136927ef29 [2025-03-04 06:22:41,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:22:41,899 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:22:41,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:22:41,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:22:41,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:22:41,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:22:41" (1/1) ... [2025-03-04 06:22:41,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf32be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:41, skipping insertion in model container [2025-03-04 06:22:41,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:22:41" (1/1) ... [2025-03-04 06:22:41,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:22:42,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:22:42,179 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:22:42,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:22:42,253 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:22:42,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:42 WrapperNode [2025-03-04 06:22:42,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:22:42,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:22:42,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:22:42,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:22:42,263 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:42" (1/1) ... [2025-03-04 06:22:42,273 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:42" (1/1) ... [2025-03-04 06:22:42,289 INFO L138 Inliner]: procedures = 164, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2025-03-04 06:22:42,290 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:22:42,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:22:42,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:22:42,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:22:42,296 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:42" (1/1) ... [2025-03-04 06:22:42,296 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:42" (1/1) ... [2025-03-04 06:22:42,299 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:42" (1/1) ... [2025-03-04 06:22:42,300 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:42" (1/1) ... [2025-03-04 06:22:42,304 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:42" (1/1) ... [2025-03-04 06:22:42,305 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:42" (1/1) ... [2025-03-04 06:22:42,306 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:42" (1/1) ... [2025-03-04 06:22:42,306 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:42" (1/1) ... [2025-03-04 06:22:42,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:22:42,308 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:22:42,308 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:22:42,308 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:22:42,309 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:42" (1/1) ... [2025-03-04 06:22:42,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:22:42,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:22:42,334 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:42,337 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:42,353 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 06:22:42,353 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 06:22:42,353 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 06:22:42,353 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 06:22:42,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:22:42,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:22:42,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:22:42,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:22:42,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:22:42,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:22:42,354 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:42,459 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:22:42,461 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:22:42,698 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:22:42,699 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:22:42,756 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:22:42,756 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:22:42,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:22:42 BoogieIcfgContainer [2025-03-04 06:22:42,756 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:22:42,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:22:42,758 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:22:42,763 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:22:42,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:22:41" (1/3) ... [2025-03-04 06:22:42,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0b7e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:22:42, skipping insertion in model container [2025-03-04 06:22:42,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:42" (2/3) ... [2025-03-04 06:22:42,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0b7e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:22:42, skipping insertion in model container [2025-03-04 06:22:42,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:22:42" (3/3) ... [2025-03-04 06:22:42,765 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-6.i [2025-03-04 06:22:42,777 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:22:42,778 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_unsafe-6.i that has 3 procedures, 176 locations, 1 initial locations, 3 loop locations, and 30 error locations. [2025-03-04 06:22:42,778 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:22:42,820 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:22:42,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 183 transitions, 374 flow [2025-03-04 06:22:42,929 INFO L124 PetriNetUnfolderBase]: 8/181 cut-off events. [2025-03-04 06:22:42,932 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:42,941 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:42,941 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 183 transitions, 374 flow [2025-03-04 06:22:42,949 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 181 transitions, 368 flow [2025-03-04 06:22:42,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:22:42,970 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;@7e096065, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:22:42,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-03-04 06:22:42,978 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:22:42,979 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-04 06:22:42,979 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:42,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:42,980 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:42,980 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:42,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:42,985 INFO L85 PathProgramCache]: Analyzing trace with hash 34642534, now seen corresponding path program 1 times [2025-03-04 06:22:42,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:42,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564559248] [2025-03-04 06:22:42,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:42,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:43,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 06:22:43,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 06:22:43,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:43,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:43,136 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:43,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:43,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564559248] [2025-03-04 06:22:43,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564559248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:43,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:43,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 06:22:43,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877615060] [2025-03-04 06:22:43,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:43,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:22:43,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:43,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:22:43,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:22:43,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 183 [2025-03-04 06:22:43,181 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:43,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:43,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 183 [2025-03-04 06:22:43,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:43,247 INFO L124 PetriNetUnfolderBase]: 13/317 cut-off events. [2025-03-04 06:22:43,248 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:22:43,251 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:43,253 INFO L140 encePairwiseOnDemand]: 168/183 looper letters, 7 selfloop transitions, 0 changer transitions 0/164 dead transitions. [2025-03-04 06:22:43,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 164 transitions, 348 flow [2025-03-04 06:22:43,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:22:43,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 06:22:43,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 342 transitions. [2025-03-04 06:22:43,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9344262295081968 [2025-03-04 06:22:43,267 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:43,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 164 transitions, 348 flow [2025-03-04 06:22:43,274 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:43,277 INFO L231 Difference]: Finished difference. Result has 167 places, 164 transitions, 332 flow [2025-03-04 06:22:43,279 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:43,284 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -13 predicate places. [2025-03-04 06:22:43,284 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 164 transitions, 332 flow [2025-03-04 06:22:43,285 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:43,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:43,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:22:43,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:22:43,285 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:43,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:43,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1127263437, now seen corresponding path program 1 times [2025-03-04 06:22:43,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:43,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932140194] [2025-03-04 06:22:43,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:43,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:43,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 06:22:43,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 06:22:43,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:43,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:43,364 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:43,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:43,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932140194] [2025-03-04 06:22:43,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932140194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:43,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:43,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:43,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658584159] [2025-03-04 06:22:43,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:43,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:43,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:43,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:43,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:43,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-03-04 06:22:43,401 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:43,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:43,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-03-04 06:22:43,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:43,496 INFO L124 PetriNetUnfolderBase]: 63/594 cut-off events. [2025-03-04 06:22:43,498 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:43,504 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:43,508 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 15 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-03-04 06:22:43,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 166 transitions, 372 flow [2025-03-04 06:22:43,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-03-04 06:22:43,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8633879781420765 [2025-03-04 06:22:43,516 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:43,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 166 transitions, 372 flow [2025-03-04 06:22:43,517 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:43,519 INFO L231 Difference]: Finished difference. Result has 168 places, 163 transitions, 334 flow [2025-03-04 06:22:43,520 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:43,521 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -12 predicate places. [2025-03-04 06:22:43,521 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 163 transitions, 334 flow [2025-03-04 06:22:43,521 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:43,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:43,522 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:43,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:22:43,522 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:43,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:43,523 INFO L85 PathProgramCache]: Analyzing trace with hash 44660795, now seen corresponding path program 1 times [2025-03-04 06:22:43,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:43,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498650622] [2025-03-04 06:22:43,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:43,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:43,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 06:22:43,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 06:22:43,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:43,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:43,572 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:43,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:43,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498650622] [2025-03-04 06:22:43,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498650622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:43,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:43,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:43,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142669251] [2025-03-04 06:22:43,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:43,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:43,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:43,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:43,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:43,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-03-04 06:22:43,589 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:43,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:43,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-03-04 06:22:43,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:43,663 INFO L124 PetriNetUnfolderBase]: 50/334 cut-off events. [2025-03-04 06:22:43,663 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 06:22:43,667 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:43,668 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 14 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2025-03-04 06:22:43,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 370 flow [2025-03-04 06:22:43,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:43,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-03-04 06:22:43,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8633879781420765 [2025-03-04 06:22:43,672 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:43,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 370 flow [2025-03-04 06:22:43,673 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:43,674 INFO L231 Difference]: Finished difference. Result has 166 places, 161 transitions, 330 flow [2025-03-04 06:22:43,674 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:43,675 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -14 predicate places. [2025-03-04 06:22:43,675 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 161 transitions, 330 flow [2025-03-04 06:22:43,676 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:43,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:43,676 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:43,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:22:43,676 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:43,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:43,677 INFO L85 PathProgramCache]: Analyzing trace with hash -979585613, now seen corresponding path program 1 times [2025-03-04 06:22:43,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:43,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068096705] [2025-03-04 06:22:43,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:43,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:43,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 06:22:43,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 06:22:43,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:43,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:43,731 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:43,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:43,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068096705] [2025-03-04 06:22:43,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068096705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:43,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:43,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:43,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176433555] [2025-03-04 06:22:43,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:43,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:43,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:43,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:43,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:43,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-03-04 06:22:43,774 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:43,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:43,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-03-04 06:22:43,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:43,832 INFO L124 PetriNetUnfolderBase]: 41/346 cut-off events. [2025-03-04 06:22:43,833 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:43,835 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:43,836 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 14 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2025-03-04 06:22:43,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 162 transitions, 364 flow [2025-03-04 06:22:43,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-03-04 06:22:43,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-03-04 06:22:43,839 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:43,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 162 transitions, 364 flow [2025-03-04 06:22:43,840 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:43,842 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 328 flow [2025-03-04 06:22:43,843 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:43,845 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -15 predicate places. [2025-03-04 06:22:43,845 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 328 flow [2025-03-04 06:22:43,845 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:43,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:43,845 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:43,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:22:43,846 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:43,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:43,847 INFO L85 PathProgramCache]: Analyzing trace with hash 537829956, now seen corresponding path program 1 times [2025-03-04 06:22:43,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:43,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482763246] [2025-03-04 06:22:43,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:43,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:43,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 06:22:43,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 06:22:43,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:43,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:43,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:22:43,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:43,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482763246] [2025-03-04 06:22:43,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482763246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:43,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:43,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:43,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733472588] [2025-03-04 06:22:43,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:43,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:43,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:43,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:43,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:43,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2025-03-04 06:22:43,921 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:43,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:43,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2025-03-04 06:22:43,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:44,011 INFO L124 PetriNetUnfolderBase]: 65/510 cut-off events. [2025-03-04 06:22:44,011 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:44,012 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:44,014 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 16 selfloop transitions, 2 changer transitions 0/161 dead transitions. [2025-03-04 06:22:44,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 161 transitions, 366 flow [2025-03-04 06:22:44,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:44,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2025-03-04 06:22:44,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8542805100182149 [2025-03-04 06:22:44,017 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:44,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 161 transitions, 366 flow [2025-03-04 06:22:44,018 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:44,019 INFO L231 Difference]: Finished difference. Result has 164 places, 159 transitions, 326 flow [2025-03-04 06:22:44,020 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:44,021 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -16 predicate places. [2025-03-04 06:22:44,022 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 159 transitions, 326 flow [2025-03-04 06:22:44,023 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:44,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:44,023 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:44,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:22:44,023 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:44,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:44,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1468234265, now seen corresponding path program 1 times [2025-03-04 06:22:44,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:44,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618345376] [2025-03-04 06:22:44,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:44,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:44,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 06:22:44,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 06:22:44,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:44,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:44,058 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,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:44,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618345376] [2025-03-04 06:22:44,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618345376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:44,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:44,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:44,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717594152] [2025-03-04 06:22:44,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:44,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:44,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:44,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:44,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:44,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-03-04 06:22:44,072 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:44,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:44,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-03-04 06:22:44,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:44,117 INFO L124 PetriNetUnfolderBase]: 37/358 cut-off events. [2025-03-04 06:22:44,117 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:44,119 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:44,120 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 13 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2025-03-04 06:22:44,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 159 transitions, 356 flow [2025-03-04 06:22:44,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:44,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-03-04 06:22:44,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-03-04 06:22:44,122 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:44,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 159 transitions, 356 flow [2025-03-04 06:22:44,123 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:44,124 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 322 flow [2025-03-04 06:22:44,125 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:44,125 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -18 predicate places. [2025-03-04 06:22:44,125 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 322 flow [2025-03-04 06:22:44,126 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:44,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:44,126 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:44,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:22:44,126 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:44,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:44,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1198535268, now seen corresponding path program 1 times [2025-03-04 06:22:44,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:44,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341333885] [2025-03-04 06:22:44,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:44,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:44,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:22:44,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:22:44,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:44,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:44,161 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,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:44,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341333885] [2025-03-04 06:22:44,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341333885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:44,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:44,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:44,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107999919] [2025-03-04 06:22:44,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:44,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:44,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:44,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:44,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:44,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-03-04 06:22:44,182 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:44,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:44,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-03-04 06:22:44,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:44,227 INFO L124 PetriNetUnfolderBase]: 49/403 cut-off events. [2025-03-04 06:22:44,228 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:44,230 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:44,231 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 15 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2025-03-04 06:22:44,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 159 transitions, 362 flow [2025-03-04 06:22:44,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:44,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:44,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-03-04 06:22:44,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8633879781420765 [2025-03-04 06:22:44,233 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:44,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 159 transitions, 362 flow [2025-03-04 06:22:44,234 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:44,235 INFO L231 Difference]: Finished difference. Result has 161 places, 156 transitions, 320 flow [2025-03-04 06:22:44,236 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:44,236 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -19 predicate places. [2025-03-04 06:22:44,236 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 156 transitions, 320 flow [2025-03-04 06:22:44,237 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:44,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:44,237 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:44,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:22:44,237 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:44,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:44,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2030355302, now seen corresponding path program 1 times [2025-03-04 06:22:44,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:44,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71091225] [2025-03-04 06:22:44,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:44,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:44,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:22:44,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:22:44,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:44,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:44,260 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,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:44,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71091225] [2025-03-04 06:22:44,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71091225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:44,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:44,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:44,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269694619] [2025-03-04 06:22:44,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:44,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:44,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:44,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:44,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:44,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-03-04 06:22:44,276 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:44,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:44,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-03-04 06:22:44,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:44,331 INFO L124 PetriNetUnfolderBase]: 37/427 cut-off events. [2025-03-04 06:22:44,331 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:44,333 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:44,334 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 13 selfloop transitions, 2 changer transitions 0/156 dead transitions. [2025-03-04 06:22:44,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 156 transitions, 350 flow [2025-03-04 06:22:44,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:44,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-03-04 06:22:44,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-03-04 06:22:44,336 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:44,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 156 transitions, 350 flow [2025-03-04 06:22:44,337 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:44,338 INFO L231 Difference]: Finished difference. Result has 159 places, 154 transitions, 316 flow [2025-03-04 06:22:44,338 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:44,338 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -21 predicate places. [2025-03-04 06:22:44,338 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 154 transitions, 316 flow [2025-03-04 06:22:44,339 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:44,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:44,339 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:44,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:22:44,339 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:44,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:44,339 INFO L85 PathProgramCache]: Analyzing trace with hash -290113610, now seen corresponding path program 1 times [2025-03-04 06:22:44,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:44,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907013932] [2025-03-04 06:22:44,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:44,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:44,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 06:22:44,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 06:22:44,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:44,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:44,377 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,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:44,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907013932] [2025-03-04 06:22:44,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907013932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:44,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:44,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:22:44,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973249370] [2025-03-04 06:22:44,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:44,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:44,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:44,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:44,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:44,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 183 [2025-03-04 06:22:44,385 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:44,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:44,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 183 [2025-03-04 06:22:44,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:44,432 INFO L124 PetriNetUnfolderBase]: 25/567 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,435 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:44,437 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 12 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-03-04 06:22:44,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 350 flow [2025-03-04 06:22:44,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:44,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2025-03-04 06:22:44,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8797814207650273 [2025-03-04 06:22:44,438 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:44,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 350 flow [2025-03-04 06:22:44,439 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:44,441 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 324 flow [2025-03-04 06:22:44,441 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:44,442 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -20 predicate places. [2025-03-04 06:22:44,442 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 324 flow [2025-03-04 06:22:44,442 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:44,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:44,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:22:44,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:22:44,442 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:44,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:44,443 INFO L85 PathProgramCache]: Analyzing trace with hash -290112787, now seen corresponding path program 1 times [2025-03-04 06:22:44,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:44,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626695532] [2025-03-04 06:22:44,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:44,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:44,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 06:22:44,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 06:22:44,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:44,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:44,463 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,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:44,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626695532] [2025-03-04 06:22:44,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626695532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:44,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:44,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:44,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311108848] [2025-03-04 06:22:44,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:44,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:44,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:44,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:44,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:44,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 183 [2025-03-04 06:22:44,473 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:44,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:44,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 183 [2025-03-04 06:22:44,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:44,530 INFO L124 PetriNetUnfolderBase]: 57/553 cut-off events. [2025-03-04 06:22:44,530 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:22:44,533 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:44,535 INFO L140 encePairwiseOnDemand]: 178/183 looper letters, 11 selfloop transitions, 3 changer transitions 0/155 dead transitions. [2025-03-04 06:22:44,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 155 transitions, 352 flow [2025-03-04 06:22:44,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:44,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-03-04 06:22:44,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8652094717668488 [2025-03-04 06:22:44,536 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:44,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 155 transitions, 352 flow [2025-03-04 06:22:44,538 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:44,539 INFO L231 Difference]: Finished difference. Result has 159 places, 153 transitions, 324 flow [2025-03-04 06:22:44,539 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:44,540 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -21 predicate places. [2025-03-04 06:22:44,540 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 153 transitions, 324 flow [2025-03-04 06:22:44,540 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:44,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:44,540 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:44,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:22:44,540 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:44,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:44,541 INFO L85 PathProgramCache]: Analyzing trace with hash 374494858, now seen corresponding path program 1 times [2025-03-04 06:22:44,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:44,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011556709] [2025-03-04 06:22:44,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:44,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:44,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 06:22:44,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 06:22:44,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:44,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:44,574 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,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:44,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011556709] [2025-03-04 06:22:44,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011556709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:44,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:44,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:44,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592195896] [2025-03-04 06:22:44,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:44,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:44,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:44,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:44,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:44,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 183 [2025-03-04 06:22:44,587 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:44,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:44,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 183 [2025-03-04 06:22:44,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:44,656 INFO L124 PetriNetUnfolderBase]: 65/561 cut-off events. [2025-03-04 06:22:44,657 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:44,659 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:44,661 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 12 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2025-03-04 06:22:44,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 153 transitions, 352 flow [2025-03-04 06:22:44,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:44,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:44,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-03-04 06:22:44,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8652094717668488 [2025-03-04 06:22:44,663 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:44,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 153 transitions, 352 flow [2025-03-04 06:22:44,664 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:44,665 INFO L231 Difference]: Finished difference. Result has 157 places, 151 transitions, 318 flow [2025-03-04 06:22:44,665 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:44,666 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -23 predicate places. [2025-03-04 06:22:44,666 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 151 transitions, 318 flow [2025-03-04 06:22:44,666 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:44,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:44,666 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:44,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:22:44,667 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:44,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:44,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1314944668, now seen corresponding path program 1 times [2025-03-04 06:22:44,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:44,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566132716] [2025-03-04 06:22:44,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:44,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:44,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 06:22:44,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 06:22:44,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:44,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:44,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:44,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:44,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566132716] [2025-03-04 06:22:44,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566132716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:44,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:44,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:44,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53170435] [2025-03-04 06:22:44,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:44,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:44,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:44,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:44,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:44,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-03-04 06:22:44,710 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:44,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:44,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-03-04 06:22:44,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:44,752 INFO L124 PetriNetUnfolderBase]: 37/409 cut-off events. [2025-03-04 06:22:44,753 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:44,755 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:44,756 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 14 selfloop transitions, 2 changer transitions 0/152 dead transitions. [2025-03-04 06:22:44,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 152 transitions, 352 flow [2025-03-04 06:22:44,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:44,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:44,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-03-04 06:22:44,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-03-04 06:22:44,758 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:44,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 152 transitions, 352 flow [2025-03-04 06:22:44,759 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:44,760 INFO L231 Difference]: Finished difference. Result has 156 places, 150 transitions, 316 flow [2025-03-04 06:22:44,761 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:44,761 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -24 predicate places. [2025-03-04 06:22:44,761 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 150 transitions, 316 flow [2025-03-04 06:22:44,761 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:44,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:44,761 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:44,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:22:44,762 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:44,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:44,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1634374500, now seen corresponding path program 1 times [2025-03-04 06:22:44,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:44,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433198962] [2025-03-04 06:22:44,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:44,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:44,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:22:44,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:22:44,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:44,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:44,797 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,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:44,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433198962] [2025-03-04 06:22:44,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433198962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:44,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:44,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:44,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825119936] [2025-03-04 06:22:44,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:44,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:44,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:44,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:44,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:44,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-03-04 06:22:44,815 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:44,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:44,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-03-04 06:22:44,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:44,864 INFO L124 PetriNetUnfolderBase]: 61/567 cut-off events. [2025-03-04 06:22:44,864 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:44,866 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:44,868 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 14 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2025-03-04 06:22:44,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 151 transitions, 350 flow [2025-03-04 06:22:44,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:44,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-03-04 06:22:44,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-03-04 06:22:44,869 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:44,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 151 transitions, 350 flow [2025-03-04 06:22:44,871 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:44,872 INFO L231 Difference]: Finished difference. Result has 155 places, 149 transitions, 314 flow [2025-03-04 06:22:44,872 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:44,873 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -25 predicate places. [2025-03-04 06:22:44,873 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 149 transitions, 314 flow [2025-03-04 06:22:44,873 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:44,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:44,874 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:44,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:22:44,874 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:44,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:44,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2031917957, now seen corresponding path program 1 times [2025-03-04 06:22:44,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:44,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837023996] [2025-03-04 06:22:44,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:44,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:44,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 06:22:44,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 06:22:44,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:44,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:44,910 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,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:44,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837023996] [2025-03-04 06:22:44,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837023996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:44,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:44,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:44,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666453615] [2025-03-04 06:22:44,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:44,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:44,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:44,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:44,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:44,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2025-03-04 06:22:44,927 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:44,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:44,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2025-03-04 06:22:44,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:44,974 INFO L124 PetriNetUnfolderBase]: 65/563 cut-off events. [2025-03-04 06:22:44,974 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:44,976 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:44,978 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 15 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2025-03-04 06:22:44,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 150 transitions, 350 flow [2025-03-04 06:22:44,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-03-04 06:22:44,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8579234972677595 [2025-03-04 06:22:44,980 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:44,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 150 transitions, 350 flow [2025-03-04 06:22:44,980 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:44,982 INFO L231 Difference]: Finished difference. Result has 154 places, 148 transitions, 312 flow [2025-03-04 06:22:44,983 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:44,984 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -26 predicate places. [2025-03-04 06:22:44,984 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 148 transitions, 312 flow [2025-03-04 06:22:44,984 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,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:44,984 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:44,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:22:44,984 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:44,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:44,985 INFO L85 PathProgramCache]: Analyzing trace with hash 401536390, now seen corresponding path program 1 times [2025-03-04 06:22:44,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:44,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032784114] [2025-03-04 06:22:44,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:44,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:44,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 06:22:44,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 06:22:44,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:44,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:45,015 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,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:45,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032784114] [2025-03-04 06:22:45,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032784114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:45,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:45,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:45,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643319442] [2025-03-04 06:22:45,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:45,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:45,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:45,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:45,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:45,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 183 [2025-03-04 06:22:45,023 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:45,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:45,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 183 [2025-03-04 06:22:45,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:45,076 INFO L124 PetriNetUnfolderBase]: 51/535 cut-off events. [2025-03-04 06:22:45,077 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:45,078 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:45,079 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 11 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2025-03-04 06:22:45,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 150 transitions, 342 flow [2025-03-04 06:22:45,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2025-03-04 06:22:45,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8779599271402551 [2025-03-04 06:22:45,080 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:45,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 150 transitions, 342 flow [2025-03-04 06:22:45,082 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:45,083 INFO L231 Difference]: Finished difference. Result has 154 places, 148 transitions, 316 flow [2025-03-04 06:22:45,085 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:45,085 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -26 predicate places. [2025-03-04 06:22:45,085 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 148 transitions, 316 flow [2025-03-04 06:22:45,086 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,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:45,086 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:45,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:22:45,086 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:45,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:45,087 INFO L85 PathProgramCache]: Analyzing trace with hash -179450328, now seen corresponding path program 1 times [2025-03-04 06:22:45,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:45,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875312389] [2025-03-04 06:22:45,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:45,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:45,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 06:22:45,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 06:22:45,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:45,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:45,121 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,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:45,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875312389] [2025-03-04 06:22:45,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875312389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:45,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:45,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:45,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844288684] [2025-03-04 06:22:45,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:45,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:45,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:45,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:45,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:45,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2025-03-04 06:22:45,143 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:45,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:45,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2025-03-04 06:22:45,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:45,190 INFO L124 PetriNetUnfolderBase]: 69/551 cut-off events. [2025-03-04 06:22:45,190 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 06:22:45,192 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:45,193 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 15 selfloop transitions, 2 changer transitions 0/149 dead transitions. [2025-03-04 06:22:45,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 149 transitions, 352 flow [2025-03-04 06:22:45,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:45,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-03-04 06:22:45,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8579234972677595 [2025-03-04 06:22:45,195 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:45,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 149 transitions, 352 flow [2025-03-04 06:22:45,196 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:45,197 INFO L231 Difference]: Finished difference. Result has 154 places, 147 transitions, 316 flow [2025-03-04 06:22:45,197 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:45,198 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -26 predicate places. [2025-03-04 06:22:45,198 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 147 transitions, 316 flow [2025-03-04 06:22:45,198 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,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:45,198 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:45,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:22:45,198 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:45,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:45,199 INFO L85 PathProgramCache]: Analyzing trace with hash 281682885, now seen corresponding path program 1 times [2025-03-04 06:22:45,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:45,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393914616] [2025-03-04 06:22:45,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:45,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:45,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 06:22:45,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 06:22:45,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:45,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:45,229 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,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:45,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393914616] [2025-03-04 06:22:45,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393914616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:45,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:45,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:45,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417475484] [2025-03-04 06:22:45,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:45,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:45,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:45,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:45,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:45,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2025-03-04 06:22:45,244 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:45,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:45,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2025-03-04 06:22:45,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:45,286 INFO L124 PetriNetUnfolderBase]: 57/535 cut-off events. [2025-03-04 06:22:45,286 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:45,288 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:45,288 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 0 selfloop transitions, 0 changer transitions 148/148 dead transitions. [2025-03-04 06:22:45,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 148 transitions, 354 flow [2025-03-04 06:22:45,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2025-03-04 06:22:45,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8542805100182149 [2025-03-04 06:22:45,290 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:45,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 148 transitions, 354 flow [2025-03-04 06:22:45,291 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:45,291 INFO L231 Difference]: Finished difference. Result has 153 places, 0 transitions, 0 flow [2025-03-04 06:22:45,291 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:45,292 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -27 predicate places. [2025-03-04 06:22:45,292 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 0 transitions, 0 flow [2025-03-04 06:22:45,292 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:45,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2025-03-04 06:22:45,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2025-03-04 06:22:45,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2025-03-04 06:22:45,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2025-03-04 06:22:45,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2025-03-04 06:22:45,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2025-03-04 06:22:45,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2025-03-04 06:22:45,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2025-03-04 06:22:45,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2025-03-04 06:22:45,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2025-03-04 06:22:45,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2025-03-04 06:22:45,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2025-03-04 06:22:45,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2025-03-04 06:22:45,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2025-03-04 06:22:45,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2025-03-04 06:22:45,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2025-03-04 06:22:45,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2025-03-04 06:22:45,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2025-03-04 06:22:45,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2025-03-04 06:22:45,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2025-03-04 06:22:45,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2025-03-04 06:22:45,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2025-03-04 06:22:45,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2025-03-04 06:22:45,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2025-03-04 06:22:45,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2025-03-04 06:22:45,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2025-03-04 06:22:45,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2025-03-04 06:22:45,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2025-03-04 06:22:45,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2025-03-04 06:22:45,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2025-03-04 06:22:45,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2025-03-04 06:22:45,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2025-03-04 06:22:45,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2025-03-04 06:22:45,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2025-03-04 06:22:45,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2025-03-04 06:22:45,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2025-03-04 06:22:45,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2025-03-04 06:22:45,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2025-03-04 06:22:45,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2025-03-04 06:22:45,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2025-03-04 06:22:45,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2025-03-04 06:22:45,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2025-03-04 06:22:45,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2025-03-04 06:22:45,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2025-03-04 06:22:45,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2025-03-04 06:22:45,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2025-03-04 06:22:45,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:22:45,297 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:45,301 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:22:45,301 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:22:45,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:22:45 BasicIcfg [2025-03-04 06:22:45,306 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:22:45,306 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:22:45,306 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:22:45,306 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:22:45,307 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:42" (3/4) ... [2025-03-04 06:22:45,308 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:22:45,309 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-03-04 06:22:45,310 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-03-04 06:22:45,312 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 06:22:45,312 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 06:22:45,312 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 06:22:45,312 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:22:45,360 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:22:45,360 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:22:45,360 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:22:45,361 INFO L158 Benchmark]: Toolchain (without parser) took 3461.88ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 110.6MB in the beginning and 62.7MB in the end (delta: 47.8MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. [2025-03-04 06:22:45,361 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:22:45,361 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.03ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 90.9MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 06:22:45,361 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.54ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 89.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:22:45,361 INFO L158 Benchmark]: Boogie Preprocessor took 17.63ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 87.9MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:22:45,362 INFO L158 Benchmark]: IcfgBuilder took 448.29ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 63.6MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 06:22:45,362 INFO L158 Benchmark]: TraceAbstraction took 2547.34ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 63.2MB in the beginning and 67.7MB in the end (delta: -4.5MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2025-03-04 06:22:45,362 INFO L158 Benchmark]: Witness Printer took 54.14ms. Allocated memory is still 176.2MB. Free memory was 67.7MB in the beginning and 62.7MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:22:45,363 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.56ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.03ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 90.9MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.54ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 89.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.63ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 87.9MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 448.29ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 63.6MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2547.34ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 63.2MB in the beginning and 67.7MB in the end (delta: -4.5MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * Witness Printer took 54.14ms. Allocated memory is still 176.2MB. Free memory was 67.7MB in the beginning and 62.7MB in the end (delta: 4.9MB). 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.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, 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:45,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE